./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-races/race-3_2-container_of-global_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-races/race-3_2-container_of-global_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 be78f24495f6395b0c8bd7d622003423e0349301 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 01:00:06,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 01:00:06,889 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 01:00:06,908 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 01:00:06,908 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 01:00:06,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 01:00:06,913 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 01:00:06,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 01:00:06,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 01:00:06,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 01:00:06,920 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 01:00:06,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 01:00:06,921 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 01:00:06,923 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 01:00:06,924 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 01:00:06,924 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 01:00:06,926 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 01:00:06,928 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 01:00:06,930 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 01:00:06,932 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 01:00:06,934 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 01:00:06,935 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 01:00:06,938 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 01:00:06,939 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 01:00:06,939 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 01:00:06,940 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 01:00:06,941 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 01:00:06,943 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 01:00:06,943 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 01:00:06,945 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 01:00:06,945 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 01:00:06,946 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 01:00:06,946 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 01:00:06,946 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 01:00:06,948 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 01:00:06,949 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 01:00:06,949 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 01:00:06,968 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 01:00:06,968 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 01:00:06,970 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 01:00:06,970 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 01:00:06,970 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 01:00:06,970 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 01:00:06,970 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 01:00:06,971 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 01:00:06,971 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 01:00:06,971 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 01:00:06,971 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 01:00:06,971 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 01:00:06,971 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 01:00:06,972 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 01:00:06,972 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 01:00:06,972 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 01:00:06,972 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 01:00:06,972 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 01:00:06,972 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 01:00:06,973 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 01:00:06,973 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 01:00:06,973 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 01:00:06,973 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 01:00:06,973 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 01:00:06,973 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 01:00:06,974 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 01:00:06,974 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 01:00:06,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 01:00:06,974 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 -> be78f24495f6395b0c8bd7d622003423e0349301 [2019-01-01 01:00:07,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 01:00:07,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 01:00:07,042 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 01:00:07,044 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 01:00:07,045 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 01:00:07,046 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-races/race-3_2-container_of-global_false-unreach-call.i [2019-01-01 01:00:07,119 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6f3f9b20/c0fa1ece44d44ccabf2dea247f0e2a10/FLAGb8f91c448 [2019-01-01 01:00:07,757 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 01:00:07,759 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-races/race-3_2-container_of-global_false-unreach-call.i [2019-01-01 01:00:07,784 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6f3f9b20/c0fa1ece44d44ccabf2dea247f0e2a10/FLAGb8f91c448 [2019-01-01 01:00:07,923 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6f3f9b20/c0fa1ece44d44ccabf2dea247f0e2a10 [2019-01-01 01:00:07,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 01:00:07,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 01:00:07,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 01:00:07,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 01:00:07,935 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 01:00:07,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 01:00:07" (1/1) ... [2019-01-01 01:00:07,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443faa7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 01:00:07, skipping insertion in model container [2019-01-01 01:00:07,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 01:00:07" (1/1) ... [2019-01-01 01:00:07,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 01:00:08,029 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 01:00:08,940 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 01:00:08,952 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 01:00:09,213 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 01:00:09,651 INFO L195 MainTranslator]: Completed translation [2019-01-01 01:00:09,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 01:00:09 WrapperNode [2019-01-01 01:00:09,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 01:00:09,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 01:00:09,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 01:00:09,656 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 01:00:09,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 01:00:09" (1/1) ... [2019-01-01 01:00:09,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 01:00:09" (1/1) ... [2019-01-01 01:00:09,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 01:00:09,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 01:00:09,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 01:00:09,747 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 01:00:09,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 01:00:09" (1/1) ... [2019-01-01 01:00:09,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 01:00:09" (1/1) ... [2019-01-01 01:00:09,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 01:00:09" (1/1) ... [2019-01-01 01:00:09,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 01:00:09" (1/1) ... [2019-01-01 01:00:09,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 01:00:09" (1/1) ... [2019-01-01 01:00:09,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 01:00:09" (1/1) ... [2019-01-01 01:00:09,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 01:00:09" (1/1) ... [2019-01-01 01:00:09,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 01:00:09,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 01:00:09,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 01:00:09,839 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 01:00:09,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 01:00:09" (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-01 01:00:09,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 01:00:09,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 01:00:09,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 01:00:09,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 01:00:09,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 01:00:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-01-01 01:00:09,913 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-01-01 01:00:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 01:00:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 01:00:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 01:00:09,916 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 01:00:10,979 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 01:00:10,980 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2019-01-01 01:00:10,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 01:00:10 BoogieIcfgContainer [2019-01-01 01:00:10,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 01:00:10,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 01:00:10,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 01:00:10,990 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 01:00:10,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 01:00:07" (1/3) ... [2019-01-01 01:00:10,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75541eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 01:00:10, skipping insertion in model container [2019-01-01 01:00:10,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 01:00:09" (2/3) ... [2019-01-01 01:00:10,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75541eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 01:00:10, skipping insertion in model container [2019-01-01 01:00:10,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 01:00:10" (3/3) ... [2019-01-01 01:00:10,997 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global_false-unreach-call.i [2019-01-01 01:00:11,036 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,036 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,036 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,036 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,037 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,037 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,037 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,037 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,037 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,038 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,038 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,038 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,038 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,038 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,039 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,039 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,039 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,039 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,039 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,040 WARN L317 ript$VariableManager]: TermVariabe Thread0_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,040 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,040 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,040 WARN L317 ript$VariableManager]: TermVariabe |Thread0_my_callback_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,041 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,041 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,041 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,041 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,041 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,042 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,042 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,042 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,042 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,042 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,042 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,043 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,043 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,043 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,043 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,044 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,044 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,044 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,044 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,044 WARN L317 ript$VariableManager]: TermVariabe Thread1_my_callback_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,045 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,045 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,045 WARN L317 ript$VariableManager]: TermVariabe |Thread1_my_callback_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 01:00:11,107 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 01:00:11,107 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 01:00:11,117 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-01 01:00:11,137 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-01 01:00:11,167 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 01:00:11,168 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 01:00:11,168 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 01:00:11,168 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 01:00:11,168 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 01:00:11,169 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 01:00:11,169 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 01:00:11,169 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 01:00:11,169 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 01:00:11,184 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137places, 145 transitions [2019-01-01 01:00:11,382 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4725 states. [2019-01-01 01:00:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states. [2019-01-01 01:00:11,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 01:00:11,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:00:11,396 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] [2019-01-01 01:00:11,399 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:00:11,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:00:11,407 INFO L82 PathProgramCache]: Analyzing trace with hash 441784776, now seen corresponding path program 1 times [2019-01-01 01:00:11,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:00:11,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:00:11,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:11,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 01:00:11,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:00:12,103 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-01 01:00:12,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:00:12,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 01:00:12,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 01:00:12,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 01:00:12,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 01:00:12,129 INFO L87 Difference]: Start difference. First operand 4725 states. Second operand 6 states. [2019-01-01 01:00:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:00:13,478 INFO L93 Difference]: Finished difference Result 4724 states and 12876 transitions. [2019-01-01 01:00:13,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 01:00:13,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-01-01 01:00:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:00:13,531 INFO L225 Difference]: With dead ends: 4724 [2019-01-01 01:00:13,531 INFO L226 Difference]: Without dead ends: 3864 [2019-01-01 01:00:13,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-01 01:00:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3864 states. [2019-01-01 01:00:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3864 to 3863. [2019-01-01 01:00:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3863 states. [2019-01-01 01:00:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 10474 transitions. [2019-01-01 01:00:13,798 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 10474 transitions. Word has length 31 [2019-01-01 01:00:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:00:13,799 INFO L480 AbstractCegarLoop]: Abstraction has 3863 states and 10474 transitions. [2019-01-01 01:00:13,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 01:00:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 10474 transitions. [2019-01-01 01:00:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 01:00:13,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:00:13,801 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] [2019-01-01 01:00:13,802 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:00:13,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:00:13,802 INFO L82 PathProgramCache]: Analyzing trace with hash -804856226, now seen corresponding path program 1 times [2019-01-01 01:00:13,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:00:13,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:00:13,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:13,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 01:00:13,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:00:14,342 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-01 01:00:14,505 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-01 01:00:14,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:00:14,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 01:00:14,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 01:00:14,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 01:00:14,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 01:00:14,509 INFO L87 Difference]: Start difference. First operand 3863 states and 10474 transitions. Second operand 8 states. [2019-01-01 01:00:15,131 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 01:00:15,720 WARN L181 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-01-01 01:00:15,930 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-01-01 01:00:16,067 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2019-01-01 01:00:17,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:00:17,138 INFO L93 Difference]: Finished difference Result 3865 states and 10476 transitions. [2019-01-01 01:00:17,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 01:00:17,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-01-01 01:00:17,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:00:17,162 INFO L225 Difference]: With dead ends: 3865 [2019-01-01 01:00:17,162 INFO L226 Difference]: Without dead ends: 3865 [2019-01-01 01:00:17,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-01-01 01:00:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3865 states. [2019-01-01 01:00:17,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3865 to 3861. [2019-01-01 01:00:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3861 states. [2019-01-01 01:00:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3861 states to 3861 states and 10472 transitions. [2019-01-01 01:00:17,283 INFO L78 Accepts]: Start accepts. Automaton has 3861 states and 10472 transitions. Word has length 37 [2019-01-01 01:00:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:00:17,284 INFO L480 AbstractCegarLoop]: Abstraction has 3861 states and 10472 transitions. [2019-01-01 01:00:17,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 01:00:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3861 states and 10472 transitions. [2019-01-01 01:00:17,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-01 01:00:17,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:00:17,289 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] [2019-01-01 01:00:17,289 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:00:17,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:00:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1378309502, now seen corresponding path program 1 times [2019-01-01 01:00:17,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:00:17,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:00:17,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:17,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 01:00:17,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:00:17,777 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-01 01:00:17,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:00:17,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 01:00:17,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 01:00:17,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 01:00:17,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 01:00:17,779 INFO L87 Difference]: Start difference. First operand 3861 states and 10472 transitions. Second operand 8 states. [2019-01-01 01:00:18,181 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-01 01:00:18,625 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-01-01 01:00:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:00:20,618 INFO L93 Difference]: Finished difference Result 5825 states and 15810 transitions. [2019-01-01 01:00:20,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 01:00:20,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-01-01 01:00:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:00:20,658 INFO L225 Difference]: With dead ends: 5825 [2019-01-01 01:00:20,658 INFO L226 Difference]: Without dead ends: 5825 [2019-01-01 01:00:20,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2019-01-01 01:00:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5825 states. [2019-01-01 01:00:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5825 to 4385. [2019-01-01 01:00:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4385 states. [2019-01-01 01:00:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4385 states to 4385 states and 11916 transitions. [2019-01-01 01:00:20,816 INFO L78 Accepts]: Start accepts. Automaton has 4385 states and 11916 transitions. Word has length 55 [2019-01-01 01:00:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:00:20,818 INFO L480 AbstractCegarLoop]: Abstraction has 4385 states and 11916 transitions. [2019-01-01 01:00:20,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 01:00:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 4385 states and 11916 transitions. [2019-01-01 01:00:20,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-01 01:00:20,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:00:20,838 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] [2019-01-01 01:00:20,838 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:00:20,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:00:20,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1957942992, now seen corresponding path program 1 times [2019-01-01 01:00:20,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:00:20,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:00:20,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:20,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 01:00:20,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:00:21,186 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-01 01:00:21,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:00:21,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 01:00:21,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 01:00:21,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 01:00:21,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 01:00:21,187 INFO L87 Difference]: Start difference. First operand 4385 states and 11916 transitions. Second operand 8 states. [2019-01-01 01:00:22,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:00:22,351 INFO L93 Difference]: Finished difference Result 6349 states and 17158 transitions. [2019-01-01 01:00:22,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 01:00:22,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2019-01-01 01:00:22,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:00:22,389 INFO L225 Difference]: With dead ends: 6349 [2019-01-01 01:00:22,389 INFO L226 Difference]: Without dead ends: 5317 [2019-01-01 01:00:22,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-01-01 01:00:22,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2019-01-01 01:00:22,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 5125. [2019-01-01 01:00:22,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5125 states. [2019-01-01 01:00:22,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 13985 transitions. [2019-01-01 01:00:22,552 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 13985 transitions. Word has length 61 [2019-01-01 01:00:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:00:22,552 INFO L480 AbstractCegarLoop]: Abstraction has 5125 states and 13985 transitions. [2019-01-01 01:00:22,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 01:00:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 13985 transitions. [2019-01-01 01:00:22,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-01 01:00:22,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:00:22,560 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] [2019-01-01 01:00:22,560 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:00:22,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:00:22,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2138401985, now seen corresponding path program 1 times [2019-01-01 01:00:22,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:00:22,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:00:22,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:22,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 01:00:22,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:00:22,850 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-01 01:00:22,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:00:22,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 01:00:22,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 01:00:22,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 01:00:22,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 01:00:22,852 INFO L87 Difference]: Start difference. First operand 5125 states and 13985 transitions. Second operand 5 states. [2019-01-01 01:00:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:00:22,934 INFO L93 Difference]: Finished difference Result 1780 states and 4650 transitions. [2019-01-01 01:00:22,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 01:00:22,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-01 01:00:22,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:00:22,941 INFO L225 Difference]: With dead ends: 1780 [2019-01-01 01:00:22,942 INFO L226 Difference]: Without dead ends: 1780 [2019-01-01 01:00:22,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 01:00:22,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2019-01-01 01:00:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1780. [2019-01-01 01:00:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2019-01-01 01:00:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 4650 transitions. [2019-01-01 01:00:22,986 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 4650 transitions. Word has length 67 [2019-01-01 01:00:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:00:22,987 INFO L480 AbstractCegarLoop]: Abstraction has 1780 states and 4650 transitions. [2019-01-01 01:00:22,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 01:00:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 4650 transitions. [2019-01-01 01:00:22,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-01 01:00:22,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:00:22,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 01:00:22,994 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:00:22,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:00:22,995 INFO L82 PathProgramCache]: Analyzing trace with hash -140298928, now seen corresponding path program 1 times [2019-01-01 01:00:22,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:00:22,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:00:23,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:23,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 01:00:23,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:00:24,060 WARN L181 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-01-01 01:00:24,415 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2019-01-01 01:00:25,067 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-01 01:00:25,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:00:25,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-01 01:00:25,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 01:00:25,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 01:00:25,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-01-01 01:00:25,069 INFO L87 Difference]: Start difference. First operand 1780 states and 4650 transitions. Second operand 20 states. [2019-01-01 01:00:25,931 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2019-01-01 01:00:26,213 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-01-01 01:00:26,486 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-01-01 01:00:26,733 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-01-01 01:00:27,027 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-01-01 01:00:27,490 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-01-01 01:00:27,848 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-01-01 01:00:28,099 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-01-01 01:00:28,361 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-01-01 01:00:28,714 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-01-01 01:00:28,988 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-01-01 01:00:29,265 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-01-01 01:00:29,554 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-01-01 01:00:29,911 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-01-01 01:00:30,249 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-01-01 01:00:30,603 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-01-01 01:00:30,936 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-01-01 01:00:31,263 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-01-01 01:00:31,691 WARN L181 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-01-01 01:00:32,313 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-01-01 01:00:32,572 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-01-01 01:00:32,921 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-01-01 01:00:33,084 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-01-01 01:00:33,265 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-01-01 01:00:33,590 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-01-01 01:00:33,790 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-01-01 01:00:33,996 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-01-01 01:00:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:00:34,018 INFO L93 Difference]: Finished difference Result 2436 states and 6130 transitions. [2019-01-01 01:00:34,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-01 01:00:34,019 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 96 [2019-01-01 01:00:34,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:00:34,026 INFO L225 Difference]: With dead ends: 2436 [2019-01-01 01:00:34,027 INFO L226 Difference]: Without dead ends: 2436 [2019-01-01 01:00:34,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=680, Invalid=1770, Unknown=0, NotChecked=0, Total=2450 [2019-01-01 01:00:34,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2019-01-01 01:00:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2260. [2019-01-01 01:00:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2019-01-01 01:00:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 5786 transitions. [2019-01-01 01:00:34,085 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 5786 transitions. Word has length 96 [2019-01-01 01:00:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:00:34,086 INFO L480 AbstractCegarLoop]: Abstraction has 2260 states and 5786 transitions. [2019-01-01 01:00:34,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 01:00:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 5786 transitions. [2019-01-01 01:00:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-01 01:00:34,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:00:34,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 01:00:34,094 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:00:34,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:00:34,095 INFO L82 PathProgramCache]: Analyzing trace with hash -603998414, now seen corresponding path program 2 times [2019-01-01 01:00:34,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:00:34,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:00:34,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:34,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 01:00:34,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:00:34,555 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-01 01:00:34,725 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 01:00:34,889 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2019-01-01 01:00:35,929 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-01 01:00:35,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:00:35,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-01 01:00:35,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 01:00:35,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 01:00:35,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-01-01 01:00:35,930 INFO L87 Difference]: Start difference. First operand 2260 states and 5786 transitions. Second operand 20 states. [2019-01-01 01:00:36,461 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-01-01 01:00:36,650 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-01-01 01:00:36,905 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-01-01 01:00:37,127 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-01-01 01:00:37,360 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-01-01 01:00:37,610 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-01-01 01:00:37,837 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-01-01 01:00:38,210 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-01-01 01:00:38,504 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-01-01 01:00:38,823 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-01-01 01:00:39,392 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-01-01 01:00:39,743 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-01-01 01:00:40,076 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-01 01:00:40,356 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-01-01 01:00:40,643 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-01-01 01:00:40,983 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-01 01:00:41,636 WARN L181 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-01-01 01:00:42,017 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-01-01 01:00:42,378 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-01-01 01:00:42,711 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-01-01 01:00:43,106 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-01-01 01:00:43,824 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-01-01 01:00:44,146 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-01-01 01:00:44,393 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-01 01:00:44,563 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-01-01 01:00:44,763 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-01-01 01:00:45,074 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-01-01 01:00:45,275 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-01-01 01:00:45,485 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-01-01 01:00:45,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:00:45,505 INFO L93 Difference]: Finished difference Result 3008 states and 7304 transitions. [2019-01-01 01:00:45,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-01 01:00:45,506 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 96 [2019-01-01 01:00:45,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:00:45,512 INFO L225 Difference]: With dead ends: 3008 [2019-01-01 01:00:45,513 INFO L226 Difference]: Without dead ends: 3008 [2019-01-01 01:00:45,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=717, Invalid=1833, Unknown=0, NotChecked=0, Total=2550 [2019-01-01 01:00:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2019-01-01 01:00:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2233. [2019-01-01 01:00:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2233 states. [2019-01-01 01:00:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 5723 transitions. [2019-01-01 01:00:45,570 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 5723 transitions. Word has length 96 [2019-01-01 01:00:45,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:00:45,571 INFO L480 AbstractCegarLoop]: Abstraction has 2233 states and 5723 transitions. [2019-01-01 01:00:45,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 01:00:45,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 5723 transitions. [2019-01-01 01:00:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-01 01:00:45,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:00:45,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 01:00:45,580 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:00:45,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:00:45,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1835827562, now seen corresponding path program 3 times [2019-01-01 01:00:45,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:00:45,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:00:45,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:45,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 01:00:45,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:00:46,034 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-01 01:00:46,188 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 01:00:46,366 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 01:00:46,571 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 01:00:47,485 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-01 01:00:47,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:00:47,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-01 01:00:47,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 01:00:47,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 01:00:47,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-01-01 01:00:47,487 INFO L87 Difference]: Start difference. First operand 2233 states and 5723 transitions. Second operand 20 states. [2019-01-01 01:00:48,021 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-01-01 01:00:48,184 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-01-01 01:00:48,423 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-01-01 01:00:48,645 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-01-01 01:00:48,868 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-01-01 01:00:49,115 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-01-01 01:00:49,384 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-01-01 01:00:49,635 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-01-01 01:00:49,868 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-01-01 01:00:50,135 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-01-01 01:00:50,399 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-01-01 01:00:50,719 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-01-01 01:00:51,003 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-01-01 01:00:51,353 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-01-01 01:00:51,996 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-01-01 01:00:52,289 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-01-01 01:00:52,715 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-01-01 01:00:53,049 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-01-01 01:00:53,402 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-01-01 01:00:53,783 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-01-01 01:00:54,490 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-01-01 01:00:54,798 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-01-01 01:00:55,048 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-01 01:00:55,619 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-01-01 01:00:55,831 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-01-01 01:00:56,045 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-01-01 01:00:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:00:56,058 INFO L93 Difference]: Finished difference Result 2437 states and 6110 transitions. [2019-01-01 01:00:56,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-01 01:00:56,060 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 96 [2019-01-01 01:00:56,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:00:56,066 INFO L225 Difference]: With dead ends: 2437 [2019-01-01 01:00:56,066 INFO L226 Difference]: Without dead ends: 2437 [2019-01-01 01:00:56,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=660, Invalid=1596, Unknown=0, NotChecked=0, Total=2256 [2019-01-01 01:00:56,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2019-01-01 01:00:56,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1778. [2019-01-01 01:00:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-01-01 01:00:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4648 transitions. [2019-01-01 01:00:56,113 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4648 transitions. Word has length 96 [2019-01-01 01:00:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:00:56,114 INFO L480 AbstractCegarLoop]: Abstraction has 1778 states and 4648 transitions. [2019-01-01 01:00:56,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 01:00:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4648 transitions. [2019-01-01 01:00:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 01:00:56,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:00:56,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 01:00:56,121 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:00:56,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:00:56,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1695940575, now seen corresponding path program 1 times [2019-01-01 01:00:56,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:00:56,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:00:56,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:56,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 01:00:56,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:00:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:00:56,707 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-01 01:00:57,055 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-01 01:00:59,050 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-01 01:00:59,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:00:59,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-01-01 01:00:59,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-01 01:00:59,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 01:00:59,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2019-01-01 01:00:59,052 INFO L87 Difference]: Start difference. First operand 1778 states and 4648 transitions. Second operand 27 states. [2019-01-01 01:00:59,962 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-01 01:01:00,167 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-01 01:01:00,525 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-01-01 01:01:00,893 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-01-01 01:01:01,307 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-01-01 01:01:01,687 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-01-01 01:01:02,159 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-01-01 01:01:02,414 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-01 01:01:02,608 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-01-01 01:01:03,318 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-01 01:01:04,303 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-01-01 01:01:04,474 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-01-01 01:01:04,738 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-01-01 01:01:04,919 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-01-01 01:01:05,200 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-01-01 01:01:05,425 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-01-01 01:01:05,784 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-01-01 01:01:06,020 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-01-01 01:01:06,249 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-01-01 01:01:06,429 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-01-01 01:01:06,613 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-01 01:01:07,681 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-01 01:01:08,252 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-01-01 01:01:08,634 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-01 01:01:08,936 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-01-01 01:01:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:01:08,937 INFO L93 Difference]: Finished difference Result 2578 states and 6470 transitions. [2019-01-01 01:01:08,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-01 01:01:08,938 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2019-01-01 01:01:08,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:01:08,946 INFO L225 Difference]: With dead ends: 2578 [2019-01-01 01:01:08,946 INFO L226 Difference]: Without dead ends: 2399 [2019-01-01 01:01:08,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=673, Invalid=3359, Unknown=0, NotChecked=0, Total=4032 [2019-01-01 01:01:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2019-01-01 01:01:08,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 1778. [2019-01-01 01:01:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-01-01 01:01:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4636 transitions. [2019-01-01 01:01:08,997 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4636 transitions. Word has length 102 [2019-01-01 01:01:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:01:08,997 INFO L480 AbstractCegarLoop]: Abstraction has 1778 states and 4636 transitions. [2019-01-01 01:01:08,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-01 01:01:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4636 transitions. [2019-01-01 01:01:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 01:01:09,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:01:09,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 01:01:09,009 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:01:09,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:01:09,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1267601473, now seen corresponding path program 2 times [2019-01-01 01:01:09,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:01:09,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:01:09,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:01:09,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 01:01:09,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:01:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:01:09,697 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-01 01:01:10,157 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2019-01-01 01:01:11,846 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-01 01:01:11,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:01:11,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-01-01 01:01:11,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-01 01:01:11,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 01:01:11,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2019-01-01 01:01:11,848 INFO L87 Difference]: Start difference. First operand 1778 states and 4636 transitions. Second operand 27 states. [2019-01-01 01:01:12,789 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-01 01:01:12,991 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-01 01:01:13,251 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-01-01 01:01:13,623 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-01-01 01:01:14,006 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-01-01 01:01:14,364 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-01-01 01:01:14,817 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-01-01 01:01:15,046 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-01-01 01:01:15,233 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-01-01 01:01:15,931 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-01-01 01:01:16,128 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-01-01 01:01:16,351 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-01-01 01:01:17,318 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-01-01 01:01:17,522 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-01-01 01:01:17,849 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-01-01 01:01:18,075 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-01-01 01:01:18,437 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2019-01-01 01:01:18,697 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-01-01 01:01:18,923 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-01-01 01:01:19,103 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-01-01 01:01:19,289 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-01-01 01:01:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:01:20,737 INFO L93 Difference]: Finished difference Result 2648 states and 6761 transitions. [2019-01-01 01:01:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-01 01:01:20,737 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2019-01-01 01:01:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:01:20,745 INFO L225 Difference]: With dead ends: 2648 [2019-01-01 01:01:20,745 INFO L226 Difference]: Without dead ends: 2508 [2019-01-01 01:01:20,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=609, Invalid=2931, Unknown=0, NotChecked=0, Total=3540 [2019-01-01 01:01:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-01-01 01:01:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 1822. [2019-01-01 01:01:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1822 states. [2019-01-01 01:01:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 4753 transitions. [2019-01-01 01:01:20,794 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 4753 transitions. Word has length 102 [2019-01-01 01:01:20,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:01:20,795 INFO L480 AbstractCegarLoop]: Abstraction has 1822 states and 4753 transitions. [2019-01-01 01:01:20,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-01 01:01:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 4753 transitions. [2019-01-01 01:01:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 01:01:20,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:01:20,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 01:01:20,802 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:01:20,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:01:20,803 INFO L82 PathProgramCache]: Analyzing trace with hash 702528677, now seen corresponding path program 3 times [2019-01-01 01:01:20,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:01:20,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:01:20,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:01:20,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 01:01:20,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:01:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:01:21,327 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-01 01:01:21,653 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-01 01:01:22,066 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-01-01 01:01:22,200 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-01 01:01:23,788 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-01 01:01:23,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:01:23,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-01-01 01:01:23,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-01 01:01:23,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 01:01:23,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2019-01-01 01:01:23,790 INFO L87 Difference]: Start difference. First operand 1822 states and 4753 transitions. Second operand 27 states. [2019-01-01 01:01:24,625 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-01 01:01:24,821 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-01 01:01:25,072 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-01-01 01:01:25,441 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-01-01 01:01:25,819 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-01-01 01:01:26,209 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-01-01 01:01:26,649 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-01-01 01:01:26,864 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-01 01:01:27,036 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-01 01:01:27,690 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-01-01 01:01:27,926 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-01-01 01:01:28,146 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-01-01 01:01:28,332 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-01 01:01:28,562 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-01-01 01:01:29,945 WARN L181 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-01-01 01:01:30,151 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-01-01 01:01:30,453 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-01-01 01:01:30,681 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-01-01 01:01:30,895 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-01-01 01:01:31,075 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-01-01 01:01:31,246 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-01 01:01:32,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:01:32,652 INFO L93 Difference]: Finished difference Result 2609 states and 6673 transitions. [2019-01-01 01:01:32,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-01 01:01:32,653 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2019-01-01 01:01:32,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:01:32,657 INFO L225 Difference]: With dead ends: 2609 [2019-01-01 01:01:32,657 INFO L226 Difference]: Without dead ends: 2482 [2019-01-01 01:01:32,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=611, Invalid=2929, Unknown=0, NotChecked=0, Total=3540 [2019-01-01 01:01:32,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2019-01-01 01:01:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 1910. [2019-01-01 01:01:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-01-01 01:01:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 4987 transitions. [2019-01-01 01:01:32,715 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 4987 transitions. Word has length 102 [2019-01-01 01:01:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:01:32,716 INFO L480 AbstractCegarLoop]: Abstraction has 1910 states and 4987 transitions. [2019-01-01 01:01:32,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-01 01:01:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 4987 transitions. [2019-01-01 01:01:32,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 01:01:32,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:01:32,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 01:01:32,724 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:01:32,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:01:32,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1291018341, now seen corresponding path program 4 times [2019-01-01 01:01:32,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:01:32,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:01:32,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:01:32,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 01:01:32,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:01:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:01:33,525 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-01 01:01:33,651 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-01 01:01:35,182 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-01 01:01:35,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:01:35,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-01-01 01:01:35,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-01 01:01:35,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 01:01:35,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2019-01-01 01:01:35,184 INFO L87 Difference]: Start difference. First operand 1910 states and 4987 transitions. Second operand 27 states. [2019-01-01 01:01:36,058 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-01 01:01:36,316 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-01 01:01:36,561 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-01-01 01:01:36,932 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-01-01 01:01:37,302 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-01-01 01:01:37,697 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-01-01 01:01:38,143 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-01-01 01:01:38,359 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-01 01:01:38,522 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-01 01:01:39,141 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-01-01 01:01:39,318 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-01-01 01:01:39,537 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-01-01 01:01:39,723 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-01 01:01:39,954 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-01-01 01:01:40,709 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-01-01 01:01:40,947 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-01-01 01:01:41,156 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-01 01:01:41,351 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-01 01:01:41,542 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-01 01:01:42,315 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-01 01:01:42,483 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-01-01 01:01:42,663 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-01 01:01:43,122 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-01-01 01:01:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:01:44,242 INFO L93 Difference]: Finished difference Result 2798 states and 7119 transitions. [2019-01-01 01:01:44,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-01 01:01:44,243 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2019-01-01 01:01:44,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:01:44,247 INFO L225 Difference]: With dead ends: 2798 [2019-01-01 01:01:44,247 INFO L226 Difference]: Without dead ends: 2534 [2019-01-01 01:01:44,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=674, Invalid=3232, Unknown=0, NotChecked=0, Total=3906 [2019-01-01 01:01:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2019-01-01 01:01:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 1954. [2019-01-01 01:01:44,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-01-01 01:01:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 5064 transitions. [2019-01-01 01:01:44,300 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 5064 transitions. Word has length 102 [2019-01-01 01:01:44,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:01:44,301 INFO L480 AbstractCegarLoop]: Abstraction has 1954 states and 5064 transitions. [2019-01-01 01:01:44,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-01 01:01:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 5064 transitions. [2019-01-01 01:01:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 01:01:44,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:01:44,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 01:01:44,310 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:01:44,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:01:44,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2031784151, now seen corresponding path program 5 times [2019-01-01 01:01:44,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:01:44,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:01:44,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:01:44,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 01:01:44,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:01:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:01:45,162 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-01 01:01:45,294 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-01 01:01:46,785 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-01 01:01:46,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:01:46,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-01-01 01:01:46,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-01 01:01:46,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 01:01:46,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2019-01-01 01:01:46,787 INFO L87 Difference]: Start difference. First operand 1954 states and 5064 transitions. Second operand 27 states. [2019-01-01 01:01:47,616 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-01 01:01:47,815 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-01 01:01:48,073 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-01-01 01:01:48,492 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-01-01 01:01:48,961 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-01-01 01:01:49,295 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-01-01 01:01:49,734 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-01-01 01:01:50,005 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-01 01:01:50,180 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-01 01:01:50,797 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-01-01 01:01:51,803 WARN L181 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-01-01 01:01:53,086 WARN L181 SmtUtils]: Spent 897.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-01-01 01:01:53,308 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-01 01:01:53,570 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-01-01 01:01:53,924 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-01-01 01:01:54,163 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-01-01 01:01:54,805 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-01-01 01:01:55,037 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-01-01 01:01:55,260 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-01-01 01:01:55,508 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-01 01:01:55,663 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-01-01 01:01:55,838 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-01 01:01:56,007 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-01 01:01:56,167 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-01 01:01:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:01:57,788 INFO L93 Difference]: Finished difference Result 2635 states and 6663 transitions. [2019-01-01 01:01:57,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-01 01:01:57,789 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2019-01-01 01:01:57,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:01:57,791 INFO L225 Difference]: With dead ends: 2635 [2019-01-01 01:01:57,791 INFO L226 Difference]: Without dead ends: 2214 [2019-01-01 01:01:57,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=714, Invalid=3446, Unknown=0, NotChecked=0, Total=4160 [2019-01-01 01:01:57,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2019-01-01 01:01:57,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 1634. [2019-01-01 01:01:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-01-01 01:01:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 4228 transitions. [2019-01-01 01:01:57,825 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 4228 transitions. Word has length 102 [2019-01-01 01:01:57,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:01:57,826 INFO L480 AbstractCegarLoop]: Abstraction has 1634 states and 4228 transitions. [2019-01-01 01:01:57,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-01 01:01:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 4228 transitions. [2019-01-01 01:01:57,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 01:01:57,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:01:57,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 01:01:57,835 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:01:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:01:57,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1203559135, now seen corresponding path program 6 times [2019-01-01 01:01:57,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:01:57,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:01:57,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:01:57,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 01:01:57,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:01:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:01:58,324 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-01 01:01:58,649 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-01 01:02:00,767 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-01 01:02:00,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:02:00,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-01-01 01:02:00,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-01 01:02:00,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-01 01:02:00,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-01-01 01:02:00,768 INFO L87 Difference]: Start difference. First operand 1634 states and 4228 transitions. Second operand 26 states. [2019-01-01 01:02:01,595 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-01 01:02:01,794 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-01 01:02:02,039 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-01-01 01:02:02,394 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-01-01 01:02:02,760 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-01-01 01:02:03,088 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-01-01 01:02:03,515 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-01-01 01:02:04,159 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-01 01:02:04,954 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-01-01 01:02:05,185 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-01-01 01:02:05,363 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-01-01 01:02:05,651 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-01-01 01:02:05,878 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-01-01 01:02:06,067 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-01-01 01:02:06,348 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2019-01-01 01:02:06,619 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-01-01 01:02:06,971 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-01-01 01:02:07,263 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-01-01 01:02:07,485 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-01-01 01:02:07,667 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-01-01 01:02:07,844 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-01-01 01:02:08,801 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-01-01 01:02:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:02:09,797 INFO L93 Difference]: Finished difference Result 2169 states and 5401 transitions. [2019-01-01 01:02:09,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-01 01:02:09,797 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2019-01-01 01:02:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:02:09,800 INFO L225 Difference]: With dead ends: 2169 [2019-01-01 01:02:09,800 INFO L226 Difference]: Without dead ends: 1990 [2019-01-01 01:02:09,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=705, Invalid=3201, Unknown=0, NotChecked=0, Total=3906 [2019-01-01 01:02:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2019-01-01 01:02:09,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1640. [2019-01-01 01:02:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1640 states. [2019-01-01 01:02:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 4237 transitions. [2019-01-01 01:02:09,834 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 4237 transitions. Word has length 102 [2019-01-01 01:02:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:02:09,834 INFO L480 AbstractCegarLoop]: Abstraction has 1640 states and 4237 transitions. [2019-01-01 01:02:09,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-01 01:02:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 4237 transitions. [2019-01-01 01:02:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 01:02:09,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:02:09,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 01:02:09,844 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:02:09,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:02:09,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1791550753, now seen corresponding path program 7 times [2019-01-01 01:02:09,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:02:09,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:02:09,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:02:09,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 01:02:09,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:02:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:02:10,483 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-01-01 01:02:10,709 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 16 [2019-01-01 01:02:11,905 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2019-01-01 01:02:12,656 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-01 01:02:12,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:02:12,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-01-01 01:02:12,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-01 01:02:12,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-01 01:02:12,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2019-01-01 01:02:12,660 INFO L87 Difference]: Start difference. First operand 1640 states and 4237 transitions. Second operand 25 states. [2019-01-01 01:02:13,576 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-01 01:02:13,852 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-01-01 01:02:14,192 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-01-01 01:02:14,621 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-01-01 01:02:14,927 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-01-01 01:02:15,328 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-01-01 01:02:16,080 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-01-01 01:02:16,292 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-01-01 01:02:16,492 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-01-01 01:02:16,917 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-01-01 01:02:17,094 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-01-01 01:02:17,393 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-01-01 01:02:17,593 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-01-01 01:02:17,807 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-01-01 01:02:18,162 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-01-01 01:02:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:02:20,076 INFO L93 Difference]: Finished difference Result 2201 states and 5491 transitions. [2019-01-01 01:02:20,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-01 01:02:20,076 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2019-01-01 01:02:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:02:20,078 INFO L225 Difference]: With dead ends: 2201 [2019-01-01 01:02:20,079 INFO L226 Difference]: Without dead ends: 2061 [2019-01-01 01:02:20,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=621, Invalid=2919, Unknown=0, NotChecked=0, Total=3540 [2019-01-01 01:02:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2019-01-01 01:02:20,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1682. [2019-01-01 01:02:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2019-01-01 01:02:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 4316 transitions. [2019-01-01 01:02:20,107 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 4316 transitions. Word has length 102 [2019-01-01 01:02:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:02:20,108 INFO L480 AbstractCegarLoop]: Abstraction has 1682 states and 4316 transitions. [2019-01-01 01:02:20,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-01 01:02:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 4316 transitions. [2019-01-01 01:02:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 01:02:20,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:02:20,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 01:02:20,114 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:02:20,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:02:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash 503358407, now seen corresponding path program 8 times [2019-01-01 01:02:20,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:02:20,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:02:20,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:02:20,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 01:02:20,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:02:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:02:21,737 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2019-01-01 01:02:22,537 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-01 01:02:22,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:02:22,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-01-01 01:02:22,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-01 01:02:22,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-01 01:02:22,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2019-01-01 01:02:22,539 INFO L87 Difference]: Start difference. First operand 1682 states and 4316 transitions. Second operand 25 states. [2019-01-01 01:02:23,456 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-01 01:02:23,680 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-01-01 01:02:24,063 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-01-01 01:02:24,539 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-01-01 01:02:24,853 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-01-01 01:02:25,285 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-01-01 01:02:25,475 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-01-01 01:02:25,982 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-01-01 01:02:26,227 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-01 01:02:26,459 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-01-01 01:02:26,720 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-01-01 01:02:27,220 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-01-01 01:02:27,627 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-01-01 01:02:27,801 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-01-01 01:02:28,023 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-01-01 01:02:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:02:29,727 INFO L93 Difference]: Finished difference Result 2162 states and 5405 transitions. [2019-01-01 01:02:29,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-01 01:02:29,728 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2019-01-01 01:02:29,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:02:29,731 INFO L225 Difference]: With dead ends: 2162 [2019-01-01 01:02:29,731 INFO L226 Difference]: Without dead ends: 2035 [2019-01-01 01:02:29,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=602, Invalid=2820, Unknown=0, NotChecked=0, Total=3422 [2019-01-01 01:02:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2019-01-01 01:02:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1686. [2019-01-01 01:02:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2019-01-01 01:02:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 4322 transitions. [2019-01-01 01:02:29,762 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 4322 transitions. Word has length 102 [2019-01-01 01:02:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:02:29,762 INFO L480 AbstractCegarLoop]: Abstraction has 1686 states and 4322 transitions. [2019-01-01 01:02:29,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-01 01:02:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 4322 transitions. [2019-01-01 01:02:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 01:02:29,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:02:29,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 01:02:29,770 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:02:29,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:02:29,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2145085227, now seen corresponding path program 1 times [2019-01-01 01:02:29,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:02:29,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:02:29,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:02:29,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 01:02:29,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:02:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 01:02:30,121 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-01 01:02:31,054 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-01 01:02:31,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 01:02:31,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-01-01 01:02:31,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 01:02:31,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 01:02:31,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-01-01 01:02:31,056 INFO L87 Difference]: Start difference. First operand 1686 states and 4322 transitions. Second operand 21 states. [2019-01-01 01:02:32,080 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-01-01 01:02:32,216 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-01-01 01:02:32,363 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-01 01:02:32,534 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-01-01 01:02:32,720 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-01-01 01:02:33,175 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-01 01:02:33,381 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-01-01 01:02:33,569 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-01-01 01:02:33,828 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-01-01 01:02:34,044 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-01-01 01:02:34,459 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-01-01 01:02:34,676 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-01-01 01:02:34,887 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-01-01 01:02:35,082 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-01-01 01:02:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 01:02:35,640 INFO L93 Difference]: Finished difference Result 1898 states and 4737 transitions. [2019-01-01 01:02:35,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-01 01:02:35,641 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2019-01-01 01:02:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 01:02:35,644 INFO L225 Difference]: With dead ends: 1898 [2019-01-01 01:02:35,644 INFO L226 Difference]: Without dead ends: 1863 [2019-01-01 01:02:35,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=503, Invalid=1137, Unknown=0, NotChecked=0, Total=1640 [2019-01-01 01:02:35,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2019-01-01 01:02:35,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1798. [2019-01-01 01:02:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1798 states. [2019-01-01 01:02:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 4580 transitions. [2019-01-01 01:02:35,672 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 4580 transitions. Word has length 102 [2019-01-01 01:02:35,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 01:02:35,672 INFO L480 AbstractCegarLoop]: Abstraction has 1798 states and 4580 transitions. [2019-01-01 01:02:35,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 01:02:35,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 4580 transitions. [2019-01-01 01:02:35,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 01:02:35,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 01:02:35,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 01:02:35,679 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 01:02:35,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 01:02:35,680 INFO L82 PathProgramCache]: Analyzing trace with hash -514816953, now seen corresponding path program 9 times [2019-01-01 01:02:35,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 01:02:35,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 01:02:35,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:02:35,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 01:02:35,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 01:02:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 01:02:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 01:02:35,788 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 01:02:35,922 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 01:02:35,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 01:02:35 BasicIcfg [2019-01-01 01:02:35,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 01:02:35,925 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 01:02:35,925 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 01:02:35,926 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 01:02:35,926 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 01:00:10" (3/4) ... [2019-01-01 01:02:35,930 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 01:02:36,051 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 01:02:36,052 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 01:02:36,053 INFO L168 Benchmark]: Toolchain (without parser) took 148125.51 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 783.3 MB). Free memory was 945.9 MB in the beginning and 753.1 MB in the end (delta: 192.8 MB). Peak memory consumption was 976.0 MB. Max. memory is 11.5 GB. [2019-01-01 01:02:36,054 INFO L168 Benchmark]: CDTParser took 0.17 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-01 01:02:36,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1724.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 945.9 MB in the beginning and 996.0 MB in the end (delta: -50.1 MB). Peak memory consumption was 90.8 MB. Max. memory is 11.5 GB. [2019-01-01 01:02:36,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.33 ms. Allocated memory is still 1.2 GB. Free memory was 996.0 MB in the beginning and 988.8 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-01-01 01:02:36,056 INFO L168 Benchmark]: Boogie Preprocessor took 91.17 ms. Allocated memory is still 1.2 GB. Free memory is still 988.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 01:02:36,060 INFO L168 Benchmark]: RCFGBuilder took 1144.68 ms. Allocated memory is still 1.2 GB. Free memory was 988.8 MB in the beginning and 940.1 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-01-01 01:02:36,060 INFO L168 Benchmark]: TraceAbstraction took 144940.48 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 656.9 MB). Free memory was 940.1 MB in the beginning and 773.2 MB in the end (delta: 166.9 MB). Peak memory consumption was 823.9 MB. Max. memory is 11.5 GB. [2019-01-01 01:02:36,061 INFO L168 Benchmark]: Witness Printer took 127.24 ms. Allocated memory is still 1.8 GB. Free memory was 773.2 MB in the beginning and 753.1 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-01-01 01:02:36,068 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.17 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 1724.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 945.9 MB in the beginning and 996.0 MB in the end (delta: -50.1 MB). Peak memory consumption was 90.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.33 ms. Allocated memory is still 1.2 GB. Free memory was 996.0 MB in the beginning and 988.8 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.17 ms. Allocated memory is still 1.2 GB. Free memory is still 988.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1144.68 ms. Allocated memory is still 1.2 GB. Free memory was 988.8 MB in the beginning and 940.1 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 144940.48 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 656.9 MB). Free memory was 940.1 MB in the beginning and 773.2 MB in the end (delta: 166.9 MB). Peak memory consumption was 823.9 MB. Max. memory is 11.5 GB. * Witness Printer took 127.24 ms. Allocated memory is still 1.8 GB. Free memory was 773.2 MB in the beginning and 753.1 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 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={-1:0}] [L3791] -1 struct device *my_dev; VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3839] -1 return 0; VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3847] -1 int ret = my_drv_init(); VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3848] COND TRUE -1 ret==0 VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3849] -1 int probe_ret; VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3850] -1 struct my_data data; VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3809] -1 data->shared.a = 0 VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3810] -1 data->shared.b = 0 VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3811] -1 data->shared.a VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3772] COND FALSE -1 !(!expression) VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3812] -1 data->shared.b VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3772] COND FALSE -1 !(!expression) VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3814] -1 int res = __VERIFIER_nondet_int(); VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3815] COND FALSE -1 !(\read(res)) VAL [my_dev={0:0}, t1={1:0}, t2={-1:0}] [L3819] -1 my_dev = &data->dev VAL [my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3822] FCALL, FORK -1 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3794] 0 struct my_data *data; VAL [arg={0:0}, arg={0:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3795] 0 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3795] 0 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3799] 0 data->shared.a = 1 VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3800] 0 data->shared.b VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3823] FCALL, FORK -1 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3824] -1 return 0; VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3851] -1 probe_ret = my_drv_probe(&data) VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3852] COND TRUE -1 probe_ret==0 VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3832] -1 void *status; VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3794] 1 struct my_data *data; VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3795] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3833] -1 \read(t1) VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3795] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3799] 1 data->shared.a = 1 VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3800] EXPR 1 data->shared.b VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3800] 1 data->shared.b = data->shared.b + 1 VAL [__mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3802] 1 return 0; VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3800] 0 data->shared.b = data->shared.b + 1 VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, data->shared.b=0, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3802] 0 return 0; VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3833] FCALL, JOIN 0 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3834] -1 \read(t2) VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3834] FCALL, JOIN 1 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3854] -1 data.shared.a VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3772] COND FALSE -1 !(!expression) VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3855] -1 data.shared.b VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3772] COND TRUE -1 !expression VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] [L3772] -1 __VERIFIER_error() VAL [\result={0:0}, __mptr={-2:40}, arg={0:0}, arg={0:0}, data={-2:0}, my_dev={-2:40}, t1={1:0}, t2={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 148 locations, 6 error locations. UNSAFE Result, 144.7s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 111.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2985 SDtfs, 12423 SDslu, 25851 SDs, 0 SdLazy, 15218 SolverSat, 1592 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 807 GetRequests, 46 SyntacticMatches, 37 SemanticMatches, 724 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7324 ImplicationChecksByTransitivity, 103.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5125occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 7429 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 29.8s InterpolantComputationTime, 1559 NumberOfCodeBlocks, 1559 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1440 ConstructedInterpolants, 0 QuantifiedInterpolants, 2361792 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...