./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f1aaf5276e100f83cf10565e66c3b5d8c0baa3bbd1a1424b76fbee71241f226 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-06 00:37:14,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 00:37:14,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 00:37:15,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 00:37:15,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 00:37:15,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 00:37:15,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 00:37:15,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 00:37:15,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 00:37:15,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 00:37:15,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 00:37:15,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 00:37:15,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 00:37:15,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 00:37:15,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 00:37:15,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 00:37:15,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 00:37:15,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 00:37:15,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 00:37:15,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 00:37:15,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 00:37:15,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 00:37:15,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 00:37:15,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 00:37:15,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 00:37:15,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 00:37:15,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 00:37:15,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 00:37:15,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 00:37:15,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 00:37:15,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 00:37:15,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 00:37:15,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 00:37:15,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 00:37:15,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 00:37:15,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 00:37:15,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 00:37:15,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 00:37:15,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 00:37:15,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 00:37:15,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 00:37:15,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-06 00:37:15,086 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 00:37:15,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 00:37:15,087 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 00:37:15,087 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 00:37:15,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 00:37:15,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 00:37:15,089 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 00:37:15,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 00:37:15,089 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-06 00:37:15,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 00:37:15,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-06 00:37:15,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 00:37:15,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 00:37:15,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 00:37:15,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 00:37:15,091 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-06 00:37:15,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 00:37:15,091 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 00:37:15,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 00:37:15,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 00:37:15,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 00:37:15,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 00:37:15,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:37:15,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 00:37:15,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 00:37:15,092 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 00:37:15,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 00:37:15,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 00:37:15,100 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 00:37:15,100 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 00:37:15,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 00:37:15,100 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 00:37:15,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 2f1aaf5276e100f83cf10565e66c3b5d8c0baa3bbd1a1424b76fbee71241f226 [2021-11-06 00:37:15,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 00:37:15,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 00:37:15,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 00:37:15,386 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 00:37:15,386 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 00:37:15,387 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i [2021-11-06 00:37:15,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abb250e8/fc7d4eceb4934139b3dc5f4b0c40bb80/FLAG3ffc7c4a9 [2021-11-06 00:37:15,853 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 00:37:15,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i [2021-11-06 00:37:15,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abb250e8/fc7d4eceb4934139b3dc5f4b0c40bb80/FLAG3ffc7c4a9 [2021-11-06 00:37:16,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abb250e8/fc7d4eceb4934139b3dc5f4b0c40bb80 [2021-11-06 00:37:16,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 00:37:16,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 00:37:16,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 00:37:16,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 00:37:16,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 00:37:16,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:37:16" (1/1) ... [2021-11-06 00:37:16,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aaa23f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:16, skipping insertion in model container [2021-11-06 00:37:16,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:37:16" (1/1) ... [2021-11-06 00:37:16,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 00:37:16,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 00:37:16,515 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i[33021,33034] [2021-11-06 00:37:16,601 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i[44590,44603] [2021-11-06 00:37:16,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:37:16,613 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 00:37:16,632 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i[33021,33034] [2021-11-06 00:37:16,678 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i[44590,44603] [2021-11-06 00:37:16,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:37:16,714 INFO L208 MainTranslator]: Completed translation [2021-11-06 00:37:16,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:16 WrapperNode [2021-11-06 00:37:16,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 00:37:16,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 00:37:16,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 00:37:16,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 00:37:16,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:16" (1/1) ... [2021-11-06 00:37:16,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:16" (1/1) ... [2021-11-06 00:37:16,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 00:37:16,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 00:37:16,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 00:37:16,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 00:37:16,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:16" (1/1) ... [2021-11-06 00:37:16,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:16" (1/1) ... [2021-11-06 00:37:16,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:16" (1/1) ... [2021-11-06 00:37:16,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:16" (1/1) ... [2021-11-06 00:37:16,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:16" (1/1) ... [2021-11-06 00:37:16,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:16" (1/1) ... [2021-11-06 00:37:16,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:16" (1/1) ... [2021-11-06 00:37:16,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 00:37:16,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 00:37:16,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 00:37:16,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 00:37:16,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:16" (1/1) ... [2021-11-06 00:37:16,905 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:37:16,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:37:16,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 00:37:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 00:37:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 00:37:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 00:37:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 00:37:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 00:37:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 00:37:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 00:37:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 00:37:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 00:37:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 00:37:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 00:37:16,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 00:37:17,629 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 00:37:17,630 INFO L299 CfgBuilder]: Removed 85 assume(true) statements. [2021-11-06 00:37:17,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:37:17 BoogieIcfgContainer [2021-11-06 00:37:17,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 00:37:17,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 00:37:17,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 00:37:17,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 00:37:17,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:37:16" (1/3) ... [2021-11-06 00:37:17,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37674a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:37:17, skipping insertion in model container [2021-11-06 00:37:17,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:16" (2/3) ... [2021-11-06 00:37:17,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37674a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:37:17, skipping insertion in model container [2021-11-06 00:37:17,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:37:17" (3/3) ... [2021-11-06 00:37:17,637 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test3-1.i [2021-11-06 00:37:17,642 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 00:37:17,642 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-06 00:37:17,678 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 00:37:17,683 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 00:37:17,684 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-06 00:37:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 195 states have (on average 1.7230769230769232) internal successors, (336), 201 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:17,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-06 00:37:17,702 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:17,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:17,703 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash 239232295, now seen corresponding path program 1 times [2021-11-06 00:37:17,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:37:17,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118252429] [2021-11-06 00:37:17,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:17,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:37:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:17,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:37:17,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118252429] [2021-11-06 00:37:17,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118252429] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:17,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:17,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 00:37:17,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777541049] [2021-11-06 00:37:17,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:17,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 00:37:17,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:37:17,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 00:37:17,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:37:17,842 INFO L87 Difference]: Start difference. First operand has 202 states, 195 states have (on average 1.7230769230769232) internal successors, (336), 201 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:17,867 INFO L93 Difference]: Finished difference Result 402 states and 670 transitions. [2021-11-06 00:37:17,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 00:37:17,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-06 00:37:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:17,878 INFO L225 Difference]: With dead ends: 402 [2021-11-06 00:37:17,878 INFO L226 Difference]: Without dead ends: 198 [2021-11-06 00:37:17,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:37:17,882 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.81ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:17,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.81ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-06 00:37:17,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-06 00:37:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-11-06 00:37:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 192 states have (on average 1.3489583333333333) internal successors, (259), 197 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 259 transitions. [2021-11-06 00:37:17,931 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 259 transitions. Word has length 9 [2021-11-06 00:37:17,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:17,932 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 259 transitions. [2021-11-06 00:37:17,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 259 transitions. [2021-11-06 00:37:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-06 00:37:17,932 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:17,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:17,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 00:37:17,933 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:17,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:17,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1042319138, now seen corresponding path program 1 times [2021-11-06 00:37:17,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:37:17,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408996158] [2021-11-06 00:37:17,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:17,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:37:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:17,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:37:17,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408996158] [2021-11-06 00:37:17,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408996158] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:17,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:17,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:37:17,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72838443] [2021-11-06 00:37:17,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:17,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:37:17,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:37:17,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:37:17,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:37:18,000 INFO L87 Difference]: Start difference. First operand 198 states and 259 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:18,259 INFO L93 Difference]: Finished difference Result 445 states and 582 transitions. [2021-11-06 00:37:18,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:37:18,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-06 00:37:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:18,261 INFO L225 Difference]: With dead ends: 445 [2021-11-06 00:37:18,261 INFO L226 Difference]: Without dead ends: 337 [2021-11-06 00:37:18,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.41ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:37:18,262 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 173 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 180.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.46ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 225.18ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:18,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 642 Invalid, 161 Unknown, 0 Unchecked, 10.46ms Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 225.18ms Time] [2021-11-06 00:37:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-11-06 00:37:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 200. [2021-11-06 00:37:18,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 194 states have (on average 1.3453608247422681) internal successors, (261), 199 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 261 transitions. [2021-11-06 00:37:18,279 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 261 transitions. Word has length 12 [2021-11-06 00:37:18,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:18,279 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 261 transitions. [2021-11-06 00:37:18,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 261 transitions. [2021-11-06 00:37:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 00:37:18,284 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:18,284 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:18,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 00:37:18,285 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:18,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash 168111628, now seen corresponding path program 1 times [2021-11-06 00:37:18,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:37:18,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450153849] [2021-11-06 00:37:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:18,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:37:18,303 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:37:18,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [166486622] [2021-11-06 00:37:18,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:18,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:37:18,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:37:18,305 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:37:18,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 00:37:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:18,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:37:18,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:18,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:37:18,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:37:18,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450153849] [2021-11-06 00:37:18,556 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:37:18,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166486622] [2021-11-06 00:37:18,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166486622] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:18,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:18,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:37:18,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588774432] [2021-11-06 00:37:18,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:18,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:37:18,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:37:18,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:37:18,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:37:18,558 INFO L87 Difference]: Start difference. First operand 200 states and 261 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:18,601 INFO L93 Difference]: Finished difference Result 417 states and 549 transitions. [2021-11-06 00:37:18,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:37:18,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-06 00:37:18,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:18,603 INFO L225 Difference]: With dead ends: 417 [2021-11-06 00:37:18,603 INFO L226 Difference]: Without dead ends: 221 [2021-11-06 00:37:18,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.49ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:37:18,604 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 9 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.66ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.29ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:18,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 463 Invalid, 72 Unknown, 0 Unchecked, 0.66ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 38.29ms Time] [2021-11-06 00:37:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-11-06 00:37:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2021-11-06 00:37:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 214 states have (on average 1.3130841121495327) internal successors, (281), 219 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 281 transitions. [2021-11-06 00:37:18,611 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 281 transitions. Word has length 64 [2021-11-06 00:37:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:18,611 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 281 transitions. [2021-11-06 00:37:18,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 281 transitions. [2021-11-06 00:37:18,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 00:37:18,613 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:18,613 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:18,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 00:37:18,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:37:18,830 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:18,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:18,831 INFO L85 PathProgramCache]: Analyzing trace with hash 521200010, now seen corresponding path program 1 times [2021-11-06 00:37:18,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:37:18,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389327068] [2021-11-06 00:37:18,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:18,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:37:18,842 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:37:18,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415887109] [2021-11-06 00:37:18,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:18,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:37:18,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:37:18,864 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:37:18,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 00:37:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:18,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:37:18,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:19,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:37:19,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:37:19,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389327068] [2021-11-06 00:37:19,102 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:37:19,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415887109] [2021-11-06 00:37:19,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415887109] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:19,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:19,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:37:19,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193278314] [2021-11-06 00:37:19,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:19,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:37:19,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:37:19,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:37:19,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:37:19,105 INFO L87 Difference]: Start difference. First operand 220 states and 281 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:19,164 INFO L93 Difference]: Finished difference Result 428 states and 550 transitions. [2021-11-06 00:37:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:37:19,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-06 00:37:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:19,166 INFO L225 Difference]: With dead ends: 428 [2021-11-06 00:37:19,166 INFO L226 Difference]: Without dead ends: 212 [2021-11-06 00:37:19,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.09ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:37:19,169 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 247 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.51ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.53ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:19,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 474 Invalid, 66 Unknown, 0 Unchecked, 1.51ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 48.53ms Time] [2021-11-06 00:37:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-11-06 00:37:19,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2021-11-06 00:37:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 200 states have (on average 1.3) internal successors, (260), 205 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 260 transitions. [2021-11-06 00:37:19,182 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 260 transitions. Word has length 64 [2021-11-06 00:37:19,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:19,183 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 260 transitions. [2021-11-06 00:37:19,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 260 transitions. [2021-11-06 00:37:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 00:37:19,184 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:19,184 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:19,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-06 00:37:19,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-11-06 00:37:19,404 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:19,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:19,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1012352744, now seen corresponding path program 1 times [2021-11-06 00:37:19,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:37:19,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35630375] [2021-11-06 00:37:19,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:19,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:37:19,417 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:37:19,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781852503] [2021-11-06 00:37:19,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:19,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:37:19,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:37:19,432 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:37:19,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-06 00:37:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:19,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:37:19,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:19,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:37:19,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:37:19,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35630375] [2021-11-06 00:37:19,812 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:37:19,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781852503] [2021-11-06 00:37:19,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781852503] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:19,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:19,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:37:19,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773156198] [2021-11-06 00:37:19,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:19,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:37:19,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:37:19,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:37:19,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:37:19,814 INFO L87 Difference]: Start difference. First operand 206 states and 260 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:19,873 INFO L93 Difference]: Finished difference Result 542 states and 683 transitions. [2021-11-06 00:37:19,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:37:19,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-06 00:37:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:19,874 INFO L225 Difference]: With dead ends: 542 [2021-11-06 00:37:19,874 INFO L226 Difference]: Without dead ends: 340 [2021-11-06 00:37:19,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.75ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:37:19,876 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 132 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.02ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.92ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:19,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 544 Invalid, 32 Unknown, 0 Unchecked, 1.02ms Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 50.92ms Time] [2021-11-06 00:37:19,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-06 00:37:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 312. [2021-11-06 00:37:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 306 states have (on average 1.2843137254901962) internal successors, (393), 311 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 393 transitions. [2021-11-06 00:37:19,883 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 393 transitions. Word has length 64 [2021-11-06 00:37:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:19,885 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 393 transitions. [2021-11-06 00:37:19,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 393 transitions. [2021-11-06 00:37:19,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 00:37:19,889 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:19,890 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:19,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-06 00:37:20,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:37:20,112 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:20,112 INFO L85 PathProgramCache]: Analyzing trace with hash -147792665, now seen corresponding path program 1 times [2021-11-06 00:37:20,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:37:20,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006334566] [2021-11-06 00:37:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:20,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:37:20,122 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:37:20,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [114125109] [2021-11-06 00:37:20,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:20,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:37:20,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:37:20,132 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:37:20,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-06 00:37:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:20,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:37:20,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:20,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-06 00:37:20,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-06 00:37:20,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 00:37:20,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:37:20,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:37:20,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006334566] [2021-11-06 00:37:20,385 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:37:20,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114125109] [2021-11-06 00:37:20,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114125109] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:20,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:20,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:37:20,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421221403] [2021-11-06 00:37:20,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:20,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:37:20,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:37:20,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:37:20,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:37:20,387 INFO L87 Difference]: Start difference. First operand 312 states and 393 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:20,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:20,575 INFO L93 Difference]: Finished difference Result 421 states and 537 transitions. [2021-11-06 00:37:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:37:20,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-06 00:37:20,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:20,577 INFO L225 Difference]: With dead ends: 421 [2021-11-06 00:37:20,577 INFO L226 Difference]: Without dead ends: 396 [2021-11-06 00:37:20,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.20ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:37:20,577 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 135 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 147.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.47ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 173.08ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:20,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 644 Invalid, 138 Unknown, 0 Unchecked, 1.47ms Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 173.08ms Time] [2021-11-06 00:37:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-06 00:37:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 314. [2021-11-06 00:37:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 308 states have (on average 1.2824675324675325) internal successors, (395), 313 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 395 transitions. [2021-11-06 00:37:20,584 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 395 transitions. Word has length 71 [2021-11-06 00:37:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:20,584 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 395 transitions. [2021-11-06 00:37:20,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 395 transitions. [2021-11-06 00:37:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 00:37:20,585 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:20,585 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:20,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-06 00:37:20,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:37:20,801 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:20,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2000986198, now seen corresponding path program 1 times [2021-11-06 00:37:20,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:37:20,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613294134] [2021-11-06 00:37:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:20,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:37:20,812 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:37:20,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1176607710] [2021-11-06 00:37:20,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:20,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:37:20,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:37:20,813 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:37:20,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-06 00:37:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:20,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:37:20,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 00:37:21,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:37:21,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:37:21,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613294134] [2021-11-06 00:37:21,048 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:37:21,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176607710] [2021-11-06 00:37:21,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176607710] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:21,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:21,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:37:21,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139995877] [2021-11-06 00:37:21,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:21,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:37:21,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:37:21,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:37:21,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:37:21,049 INFO L87 Difference]: Start difference. First operand 314 states and 395 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:21,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:21,102 INFO L93 Difference]: Finished difference Result 525 states and 681 transitions. [2021-11-06 00:37:21,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:37:21,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-06 00:37:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:21,103 INFO L225 Difference]: With dead ends: 525 [2021-11-06 00:37:21,103 INFO L226 Difference]: Without dead ends: 356 [2021-11-06 00:37:21,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.87ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:37:21,104 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 9 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.63ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.71ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:21,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 449 Invalid, 72 Unknown, 0 Unchecked, 0.63ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 46.71ms Time] [2021-11-06 00:37:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-11-06 00:37:21,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2021-11-06 00:37:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 348 states have (on average 1.25) internal successors, (435), 353 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 435 transitions. [2021-11-06 00:37:21,110 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 435 transitions. Word has length 103 [2021-11-06 00:37:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:21,110 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 435 transitions. [2021-11-06 00:37:21,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 435 transitions. [2021-11-06 00:37:21,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 00:37:21,111 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:21,112 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:21,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-06 00:37:21,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:37:21,335 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:21,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1973776046, now seen corresponding path program 1 times [2021-11-06 00:37:21,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:37:21,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407971002] [2021-11-06 00:37:21,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:21,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:37:21,348 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:37:21,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72986382] [2021-11-06 00:37:21,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:21,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:37:21,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:37:21,349 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:37:21,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-06 00:37:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:21,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:37:21,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 00:37:21,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:37:21,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:37:21,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407971002] [2021-11-06 00:37:21,772 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:37:21,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72986382] [2021-11-06 00:37:21,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72986382] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:21,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:21,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:37:21,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936758456] [2021-11-06 00:37:21,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:21,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:37:21,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:37:21,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:37:21,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:37:21,774 INFO L87 Difference]: Start difference. First operand 354 states and 435 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:21,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:21,826 INFO L93 Difference]: Finished difference Result 540 states and 676 transitions. [2021-11-06 00:37:21,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:37:21,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-06 00:37:21,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:21,829 INFO L225 Difference]: With dead ends: 540 [2021-11-06 00:37:21,829 INFO L226 Difference]: Without dead ends: 331 [2021-11-06 00:37:21,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.76ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:37:21,829 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 130 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.81ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.66ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:21,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 564 Invalid, 66 Unknown, 0 Unchecked, 0.81ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 42.66ms Time] [2021-11-06 00:37:21,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-11-06 00:37:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 326. [2021-11-06 00:37:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 320 states have (on average 1.228125) internal successors, (393), 325 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 393 transitions. [2021-11-06 00:37:21,835 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 393 transitions. Word has length 103 [2021-11-06 00:37:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:21,835 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 393 transitions. [2021-11-06 00:37:21,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 393 transitions. [2021-11-06 00:37:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 00:37:21,836 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:21,836 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:21,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-06 00:37:22,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:37:22,054 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:22,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:22,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1090927200, now seen corresponding path program 1 times [2021-11-06 00:37:22,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:37:22,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324565529] [2021-11-06 00:37:22,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:22,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:37:22,065 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:37:22,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848733191] [2021-11-06 00:37:22,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:22,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:37:22,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:37:22,066 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:37:22,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-06 00:37:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:22,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:37:22,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:22,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:22,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:37:22,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:37:22,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324565529] [2021-11-06 00:37:22,317 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:37:22,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848733191] [2021-11-06 00:37:22,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848733191] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:22,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:22,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:37:22,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299349645] [2021-11-06 00:37:22,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:22,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:37:22,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:37:22,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:37:22,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:37:22,319 INFO L87 Difference]: Start difference. First operand 326 states and 393 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:22,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:22,458 INFO L93 Difference]: Finished difference Result 740 states and 900 transitions. [2021-11-06 00:37:22,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 00:37:22,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-06 00:37:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:22,460 INFO L225 Difference]: With dead ends: 740 [2021-11-06 00:37:22,460 INFO L226 Difference]: Without dead ends: 462 [2021-11-06 00:37:22,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.79ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:37:22,461 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 497 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 104.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.39ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 121.69ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:22,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 498 Invalid, 82 Unknown, 0 Unchecked, 2.39ms Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 121.69ms Time] [2021-11-06 00:37:22,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-11-06 00:37:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 410. [2021-11-06 00:37:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 404 states have (on average 1.2301980198019802) internal successors, (497), 409 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 497 transitions. [2021-11-06 00:37:22,483 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 497 transitions. Word has length 103 [2021-11-06 00:37:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:22,483 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 497 transitions. [2021-11-06 00:37:22,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 497 transitions. [2021-11-06 00:37:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-06 00:37:22,484 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:22,484 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:22,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-06 00:37:22,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:37:22,702 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:22,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:22,702 INFO L85 PathProgramCache]: Analyzing trace with hash 541561274, now seen corresponding path program 1 times [2021-11-06 00:37:22,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:37:22,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453750771] [2021-11-06 00:37:22,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:22,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:37:22,720 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:37:22,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254473889] [2021-11-06 00:37:22,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:22,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:37:22,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:37:22,728 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:37:22,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-06 00:37:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:22,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-06 00:37:22,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:22,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-06 00:37:22,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-06 00:37:22,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:22,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:22,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:22,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2021-11-06 00:37:23,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2021-11-06 00:37:23,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-11-06 00:37:23,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2021-11-06 00:37:23,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:23,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2021-11-06 00:37:23,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 00:37:23,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-11-06 00:37:23,632 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-11-06 00:37:23,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2021-11-06 00:37:24,843 INFO L354 Elim1Store]: treesize reduction 364, result has 11.9 percent of original size [2021-11-06 00:37:24,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 2832 treesize of output 2281 [2021-11-06 00:37:24,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:24,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:24,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:24,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:37:29,125 INFO L354 Elim1Store]: treesize reduction 7776, result has 3.0 percent of original size [2021-11-06 00:37:29,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 3301 treesize of output 1804 [2021-11-06 00:37:29,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:37:29,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453750771] [2021-11-06 00:37:29,179 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:37:29,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254473889] [2021-11-06 00:37:29,180 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-06 00:37:29,180 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:29,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-06 00:37:29,180 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-06 00:37:29,180 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-06 00:37:29,184 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-11-06 00:37:29,185 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-11-06 00:37:29,186 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2021-11-06 00:37:29,186 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2021-11-06 00:37:29,186 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2021-11-06 00:37:29,186 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-11-06 00:37:29,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-06 00:37:29,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-06 00:37:29,406 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:29,407 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 00:37:29,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 12:37:29 BoogieIcfgContainer [2021-11-06 00:37:29,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 00:37:29,436 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 00:37:29,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 00:37:29,437 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 00:37:29,437 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:37:17" (3/4) ... [2021-11-06 00:37:29,439 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 00:37:29,439 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 00:37:29,439 INFO L158 Benchmark]: Toolchain (without parser) took 13264.42ms. Allocated memory was 58.7MB in the beginning and 157.3MB in the end (delta: 98.6MB). Free memory was 35.2MB in the beginning and 117.1MB in the end (delta: -81.8MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2021-11-06 00:37:29,440 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory was 40.6MB in the beginning and 40.5MB in the end (delta: 47.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-06 00:37:29,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.13ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 35.0MB in the beginning and 51.6MB in the end (delta: -16.6MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2021-11-06 00:37:29,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.01ms. Allocated memory is still 75.5MB. Free memory was 51.6MB in the beginning and 44.8MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-06 00:37:29,442 INFO L158 Benchmark]: Boogie Preprocessor took 113.86ms. Allocated memory is still 75.5MB. Free memory was 44.8MB in the beginning and 37.3MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-06 00:37:29,442 INFO L158 Benchmark]: RCFGBuilder took 731.74ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 37.1MB in the beginning and 68.5MB in the end (delta: -31.4MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2021-11-06 00:37:29,442 INFO L158 Benchmark]: TraceAbstraction took 11802.46ms. Allocated memory was 100.7MB in the beginning and 157.3MB in the end (delta: 56.6MB). Free memory was 67.8MB in the beginning and 117.1MB in the end (delta: -49.3MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2021-11-06 00:37:29,443 INFO L158 Benchmark]: Witness Printer took 2.48ms. Allocated memory is still 157.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-06 00:37:29,444 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory was 40.6MB in the beginning and 40.5MB in the end (delta: 47.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.13ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 35.0MB in the beginning and 51.6MB in the end (delta: -16.6MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.01ms. Allocated memory is still 75.5MB. Free memory was 51.6MB in the beginning and 44.8MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.86ms. Allocated memory is still 75.5MB. Free memory was 44.8MB in the beginning and 37.3MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 731.74ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 37.1MB in the beginning and 68.5MB in the end (delta: -31.4MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11802.46ms. Allocated memory was 100.7MB in the beginning and 157.3MB in the end (delta: 56.6MB). Free memory was 67.8MB in the beginning and 117.1MB in the end (delta: -49.3MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. * Witness Printer took 2.48ms. Allocated memory is still 157.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 750]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of bitwiseXor at line 745, overapproximation of bitwiseAnd at line 745. Possible FailurePath: [L706] int count_int_int = 0; [L733] int i; [L734] example_user_t *user, *tmp, *users=((void *)0); [L735] i=0 [L735] EXPR \read(i) [L735] COND TRUE i<10 [L736] user = (example_user_t*)malloc(sizeof(example_user_t)) [L737] COND FALSE !(user == ((void *)0)) [L740] EXPR \read(i) [L740] user->id = i [L741] EXPR \read(i) [L741] EXPR \read(i) [L741] user->cookie = i*i [L742] unsigned _ha_hashv; [L742] unsigned _hj_i,_hj_j,_hj_k; [L742] unsigned const char *_hj_key=(unsigned const char*)(&((user)->id)); [L742] _ha_hashv = 0xfeedbeefu [L742] EXPR _hj_j = 0x9e3779b9u [L742] _hj_i = _hj_j = 0x9e3779b9u [L742] _hj_k = (unsigned)(sizeof(int)) [L742] COND FALSE !(_hj_k >= 12U) [L742] _ha_hashv += (unsigned)(sizeof(int)) [L742] case 11: [L742] case 10: [L742] case 9: [L742] case 8: [L742] case 7: [L742] case 6: [L742] case 5: [L742] case 4: [L742] EXPR _hj_key[3] [L742] _hj_i += ( (unsigned)_hj_key[3] << 24 ) [L742] case 3: [L742] EXPR _hj_key[2] [L742] _hj_i += ( (unsigned)_hj_key[2] << 16 ) [L742] case 2: [L742] EXPR _hj_key[1] [L742] _hj_i += ( (unsigned)_hj_key[1] << 8 ) [L742] case 1: [L742] EXPR _hj_key[0] [L742] _hj_i += _hj_key[0] [L742] _hj_i -= _hj_j [L742] _hj_i -= _ha_hashv [L742] _hj_i ^= ( _ha_hashv >> 13 ) [L742] _hj_j -= _ha_hashv [L742] _hj_j -= _hj_i [L742] _hj_j ^= ( _hj_i << 8 ) [L742] _ha_hashv -= _hj_i [L742] _ha_hashv -= _hj_j [L742] _ha_hashv ^= ( _hj_j >> 13 ) [L742] _hj_i -= _hj_j [L742] _hj_i -= _ha_hashv [L742] _hj_i ^= ( _ha_hashv >> 12 ) [L742] _hj_j -= _ha_hashv [L742] _hj_j -= _hj_i [L742] _hj_j ^= ( _hj_i << 16 ) [L742] _ha_hashv -= _hj_i [L742] _ha_hashv -= _hj_j [L742] _ha_hashv ^= ( _hj_j >> 5 ) [L742] _hj_i -= _hj_j [L742] _hj_i -= _ha_hashv [L742] _hj_i ^= ( _ha_hashv >> 3 ) [L742] _hj_j -= _ha_hashv [L742] _hj_j -= _hj_i [L742] _hj_j ^= ( _hj_i << 10 ) [L742] _ha_hashv -= _hj_i [L742] _ha_hashv -= _hj_j [L742] _ha_hashv ^= ( _hj_j >> 15 ) [L742] (user)->hh.hashv = (_ha_hashv) [L742] (user)->hh.key = (char*) (&((user)->id)) [L742] (user)->hh.keylen = (unsigned) (sizeof(int)) [L742] COND TRUE !(users) [L742] (user)->hh.next = ((void *)0) [L742] (user)->hh.prev = ((void *)0) [L742] (user)->hh.tbl = (UT_hash_table*)malloc(sizeof(UT_hash_table)) [L742] EXPR (user)->hh.tbl [L742] COND FALSE !(!(user)->hh.tbl) [L742] (user)->hh.tbl [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->tail = &((user)->hh) [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->num_buckets = 32U [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->log2_num_buckets = 5U [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->hho = (char*)(&(user)->hh) - (char*)(user) [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->buckets = (UT_hash_bucket*)malloc(32U * sizeof(struct UT_hash_bucket)) [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->signature = 0xa0111fe1u [L742] EXPR (user)->hh.tbl [L742] EXPR (user)->hh.tbl->buckets [L742] COND FALSE !(!(user)->hh.tbl->buckets) [L742] EXPR (user)->hh.tbl [L742] (user)->hh.tbl->buckets [L742] (users) = (user) [L742] unsigned _ha_bkt; [L742] EXPR (users)->hh.tbl [L742] EXPR (users)->hh.tbl->num_items [L742] (users)->hh.tbl->num_items++ [L742] EXPR (users)->hh.tbl [L742] EXPR (users)->hh.tbl->num_buckets [L742] _ha_bkt = ((_ha_hashv) & (((users)->hh.tbl->num_buckets) - 1U)) [L742] EXPR (users)->hh.tbl [L742] EXPR (users)->hh.tbl->buckets [L742] UT_hash_bucket *_ha_head = &((users)->hh.tbl->buckets[_ha_bkt]); [L742] EXPR _ha_head->count [L742] _ha_head->count++ [L742] EXPR _ha_head->hh_head [L742] (&(user)->hh)->hh_next = _ha_head->hh_head [L742] (&(user)->hh)->hh_prev = ((void *)0) [L742] EXPR _ha_head->hh_head [L742] COND FALSE !(_ha_head->hh_head != ((void *)0)) [L742] _ha_head->hh_head = (&(user)->hh) [L742] EXPR _ha_head->count [L742] EXPR _ha_head->expand_mult [L742] (_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand [L742] EXPR (&(user)->hh)->tbl [L742] EXPR (&(user)->hh)->tbl->noexpand [L742] (_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand [L742] COND FALSE !((_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand) [L735] EXPR \read(i) [L735] i++ [L735] EXPR \read(i) [L735] COND FALSE !(i<10) [L744] i=0 [L744] EXPR \read(i) [L744] COND TRUE i<10 [L745] unsigned _hf_hashv; [L745] unsigned _hj_i,_hj_j,_hj_k; [L745] unsigned const char *_hj_key=(unsigned const char*)(&i); [L745] _hf_hashv = 0xfeedbeefu [L745] EXPR _hj_j = 0x9e3779b9u [L745] _hj_i = _hj_j = 0x9e3779b9u [L745] _hj_k = (unsigned)(sizeof(int)) [L745] COND FALSE !(_hj_k >= 12U) [L745] _hf_hashv += (unsigned)(sizeof(int)) [L745] case 11: [L745] case 10: [L745] case 9: [L745] case 8: [L745] case 7: [L745] case 6: [L745] case 5: [L745] case 4: [L745] EXPR _hj_key[3] [L745] _hj_i += ( (unsigned)_hj_key[3] << 24 ) [L745] case 3: [L745] EXPR _hj_key[2] [L745] _hj_i += ( (unsigned)_hj_key[2] << 16 ) [L745] case 2: [L745] EXPR _hj_key[1] [L745] _hj_i += ( (unsigned)_hj_key[1] << 8 ) [L745] case 1: [L745] EXPR _hj_key[0] [L745] _hj_i += _hj_key[0] [L745] _hj_i -= _hj_j [L745] _hj_i -= _hf_hashv [L745] _hj_i ^= ( _hf_hashv >> 13 ) [L745] _hj_j -= _hf_hashv [L745] _hj_j -= _hj_i [L745] _hj_j ^= ( _hj_i << 8 ) [L745] _hf_hashv -= _hj_i [L745] _hf_hashv -= _hj_j [L745] _hf_hashv ^= ( _hj_j >> 13 ) [L745] _hj_i -= _hj_j [L745] _hj_i -= _hf_hashv [L745] _hj_i ^= ( _hf_hashv >> 12 ) [L745] _hj_j -= _hf_hashv [L745] _hj_j -= _hj_i [L745] _hj_j ^= ( _hj_i << 16 ) [L745] _hf_hashv -= _hj_i [L745] _hf_hashv -= _hj_j [L745] _hf_hashv ^= ( _hj_j >> 5 ) [L745] _hj_i -= _hj_j [L745] _hj_i -= _hf_hashv [L745] _hj_i ^= ( _hf_hashv >> 3 ) [L745] _hj_j -= _hf_hashv [L745] _hj_j -= _hj_i [L745] _hj_j ^= ( _hj_i << 10 ) [L745] _hf_hashv -= _hj_i [L745] _hf_hashv -= _hj_j [L745] _hf_hashv ^= ( _hj_j >> 15 ) [L745] (tmp) = ((void *)0) [L745] COND TRUE \read(*users) [L745] unsigned _hf_bkt; [L745] EXPR (users)->hh.tbl [L745] EXPR (users)->hh.tbl->num_buckets [L745] _hf_bkt = ((_hf_hashv) & (((users)->hh.tbl->num_buckets) - 1U)) [L745] EXPR (users)->hh.tbl [L745] EXPR (users)->hh.tbl->buckets [L745] EXPR ((users)->hh.tbl->buckets[ _hf_bkt ]).hh_head [L745] COND FALSE !(((users)->hh.tbl->buckets[ _hf_bkt ]).hh_head != ((void *)0)) [L745] (tmp) = ((void *)0) [L745] COND FALSE !((tmp) != ((void *)0)) [L746] COND FALSE !(tmp != ((void *)0)) [L750] reach_error() - UnprovableResult [Line: 703]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 202 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 11730.19ms, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 21.56ms, AutomataDifference: 957.68ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 10.02ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1332 SdHoareTripleChecker+Valid, 747.06ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1332 mSDsluCounter, 4541 SdHoareTripleChecker+Invalid, 601.81ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2278 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 569 IncrementalHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 2263 mSDtfsCounter, 569 mSolverCounterSat, 20.76ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 559 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.38ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=410occurred in iteration=9, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 113.68ms AutomataMinimizationTime, 9 MinimizatonAttempts, 313 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 315.84ms SsaConstructionTime, 359.72ms SatisfiabilityAnalysisTime, 7457.75ms InterpolantComputationTime, 703 NumberOfCodeBlocks, 703 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1117 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2355 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-06 00:37:29,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f1aaf5276e100f83cf10565e66c3b5d8c0baa3bbd1a1424b76fbee71241f226 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-06 00:37:31,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 00:37:31,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 00:37:31,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 00:37:31,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 00:37:31,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 00:37:31,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 00:37:31,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 00:37:31,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 00:37:31,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 00:37:31,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 00:37:31,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 00:37:31,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 00:37:31,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 00:37:31,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 00:37:31,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 00:37:31,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 00:37:31,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 00:37:31,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 00:37:31,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 00:37:31,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 00:37:31,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 00:37:31,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 00:37:31,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 00:37:31,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 00:37:31,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 00:37:31,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 00:37:31,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 00:37:31,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 00:37:31,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 00:37:31,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 00:37:31,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 00:37:31,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 00:37:31,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 00:37:31,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 00:37:31,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 00:37:31,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 00:37:31,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 00:37:31,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 00:37:31,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 00:37:31,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 00:37:31,328 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-06 00:37:31,356 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 00:37:31,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 00:37:31,357 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 00:37:31,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 00:37:31,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 00:37:31,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 00:37:31,359 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 00:37:31,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 00:37:31,359 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-06 00:37:31,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-06 00:37:31,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 00:37:31,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 00:37:31,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 00:37:31,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 00:37:31,361 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-06 00:37:31,361 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-06 00:37:31,361 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-06 00:37:31,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 00:37:31,362 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 00:37:31,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 00:37:31,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 00:37:31,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 00:37:31,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 00:37:31,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:37:31,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 00:37:31,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 00:37:31,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 00:37:31,363 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-06 00:37:31,363 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-06 00:37:31,363 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 00:37:31,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 00:37:31,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 00:37:31,364 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 00:37:31,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-06 00:37:31,364 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 2f1aaf5276e100f83cf10565e66c3b5d8c0baa3bbd1a1424b76fbee71241f226 [2021-11-06 00:37:31,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 00:37:31,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 00:37:31,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 00:37:31,672 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 00:37:31,673 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 00:37:31,676 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i [2021-11-06 00:37:31,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28370f6ff/390231b9752a42cab0a65789f7a141a7/FLAG86242e9e2 [2021-11-06 00:37:32,309 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 00:37:32,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i [2021-11-06 00:37:32,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28370f6ff/390231b9752a42cab0a65789f7a141a7/FLAG86242e9e2 [2021-11-06 00:37:32,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28370f6ff/390231b9752a42cab0a65789f7a141a7 [2021-11-06 00:37:32,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 00:37:32,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 00:37:32,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 00:37:32,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 00:37:32,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 00:37:32,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:37:32" (1/1) ... [2021-11-06 00:37:32,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d51f874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:32, skipping insertion in model container [2021-11-06 00:37:32,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:37:32" (1/1) ... [2021-11-06 00:37:32,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 00:37:32,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 00:37:33,035 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i[33021,33034] [2021-11-06 00:37:33,150 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i[44590,44603] [2021-11-06 00:37:33,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:37:33,181 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 00:37:33,206 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i[33021,33034] [2021-11-06 00:37:33,283 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i[44590,44603] [2021-11-06 00:37:33,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:37:33,333 INFO L208 MainTranslator]: Completed translation [2021-11-06 00:37:33,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:33 WrapperNode [2021-11-06 00:37:33,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 00:37:33,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 00:37:33,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 00:37:33,338 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 00:37:33,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:33" (1/1) ... [2021-11-06 00:37:33,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:33" (1/1) ... [2021-11-06 00:37:33,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 00:37:33,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 00:37:33,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 00:37:33,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 00:37:33,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:33" (1/1) ... [2021-11-06 00:37:33,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:33" (1/1) ... [2021-11-06 00:37:33,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:33" (1/1) ... [2021-11-06 00:37:33,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:33" (1/1) ... [2021-11-06 00:37:33,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:33" (1/1) ... [2021-11-06 00:37:33,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:33" (1/1) ... [2021-11-06 00:37:33,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:33" (1/1) ... [2021-11-06 00:37:33,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 00:37:33,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 00:37:33,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 00:37:33,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 00:37:33,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:33" (1/1) ... [2021-11-06 00:37:33,541 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:37:33,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:37:33,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 00:37:33,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 00:37:33,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-06 00:37:33,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-06 00:37:33,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 00:37:33,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 00:37:33,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 00:37:33,608 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 00:37:33,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 00:37:33,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 00:37:33,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-06 00:37:33,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-06 00:37:33,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 00:37:33,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 00:37:36,989 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 00:37:36,989 INFO L299 CfgBuilder]: Removed 85 assume(true) statements. [2021-11-06 00:37:36,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:37:36 BoogieIcfgContainer [2021-11-06 00:37:36,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 00:37:36,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 00:37:36,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 00:37:36,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 00:37:36,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:37:32" (1/3) ... [2021-11-06 00:37:36,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f078865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:37:36, skipping insertion in model container [2021-11-06 00:37:36,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:37:33" (2/3) ... [2021-11-06 00:37:36,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f078865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:37:36, skipping insertion in model container [2021-11-06 00:37:36,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:37:36" (3/3) ... [2021-11-06 00:37:36,996 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test3-1.i [2021-11-06 00:37:37,000 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 00:37:37,000 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-06 00:37:37,046 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 00:37:37,062 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 00:37:37,062 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-06 00:37:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 195 states have (on average 1.7230769230769232) internal successors, (336), 201 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-06 00:37:37,084 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:37,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:37,085 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:37,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:37,092 INFO L85 PathProgramCache]: Analyzing trace with hash 239232295, now seen corresponding path program 1 times [2021-11-06 00:37:37,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:37:37,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888502838] [2021-11-06 00:37:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:37,102 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:37:37,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:37:37,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:37:37,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-06 00:37:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:37,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-06 00:37:37,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:37,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:37:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:37,361 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:37:37,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888502838] [2021-11-06 00:37:37,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888502838] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:37,362 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:37,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-06 00:37:37,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950163719] [2021-11-06 00:37:37,365 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:37,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 00:37:37,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:37:37,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 00:37:37,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:37:37,396 INFO L87 Difference]: Start difference. First operand has 202 states, 195 states have (on average 1.7230769230769232) internal successors, (336), 201 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:37,443 INFO L93 Difference]: Finished difference Result 402 states and 670 transitions. [2021-11-06 00:37:37,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 00:37:37,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-06 00:37:37,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:37,457 INFO L225 Difference]: With dead ends: 402 [2021-11-06 00:37:37,457 INFO L226 Difference]: Without dead ends: 198 [2021-11-06 00:37:37,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.09ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:37:37,463 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.23ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:37,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 4.23ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-06 00:37:37,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-06 00:37:37,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-11-06 00:37:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 192 states have (on average 1.3489583333333333) internal successors, (259), 197 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 259 transitions. [2021-11-06 00:37:37,513 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 259 transitions. Word has length 9 [2021-11-06 00:37:37,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:37,514 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 259 transitions. [2021-11-06 00:37:37,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:37,514 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 259 transitions. [2021-11-06 00:37:37,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-06 00:37:37,515 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:37,515 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:37,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-06 00:37:37,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:37:37,720 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:37,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:37,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1042319138, now seen corresponding path program 1 times [2021-11-06 00:37:37,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:37:37,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186788972] [2021-11-06 00:37:37,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:37,722 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:37:37,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:37:37,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:37:37,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-06 00:37:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:37,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:37:37,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:37,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-06 00:37:37,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-06 00:37:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:37,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:37:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:37,987 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:37:37,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186788972] [2021-11-06 00:37:37,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186788972] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:37,987 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:37,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 00:37:37,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313011905] [2021-11-06 00:37:37,988 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:37,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 00:37:37,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:37:37,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 00:37:37,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:37:37,990 INFO L87 Difference]: Start difference. First operand 198 states and 259 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:40,249 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:37:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:41,202 INFO L93 Difference]: Finished difference Result 552 states and 722 transitions. [2021-11-06 00:37:41,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 00:37:41,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-06 00:37:41,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:41,207 INFO L225 Difference]: With dead ends: 552 [2021-11-06 00:37:41,207 INFO L226 Difference]: Without dead ends: 444 [2021-11-06 00:37:41,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 25.61ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 00:37:41,208 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 477 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2931.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.41ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3166.48ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:41,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 756 Invalid, 210 Unknown, 0 Unchecked, 7.41ms Time], IncrementalHoareTripleChecker [8 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 3166.48ms Time] [2021-11-06 00:37:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-11-06 00:37:41,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 200. [2021-11-06 00:37:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 194 states have (on average 1.3453608247422681) internal successors, (261), 199 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 261 transitions. [2021-11-06 00:37:41,223 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 261 transitions. Word has length 12 [2021-11-06 00:37:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:41,224 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 261 transitions. [2021-11-06 00:37:41,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 261 transitions. [2021-11-06 00:37:41,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 00:37:41,226 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:41,226 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:41,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-06 00:37:41,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:37:41,440 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:41,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash 168111628, now seen corresponding path program 1 times [2021-11-06 00:37:41,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:37:41,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134029656] [2021-11-06 00:37:41,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:41,442 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:37:41,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:37:41,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:37:41,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-06 00:37:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:41,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:37:41,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:41,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:37:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:41,853 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:37:41,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134029656] [2021-11-06 00:37:41,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134029656] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:41,854 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:41,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:37:41,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373292448] [2021-11-06 00:37:41,854 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:41,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:37:41,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:37:41,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:37:41,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:37:41,855 INFO L87 Difference]: Start difference. First operand 200 states and 261 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:41,938 INFO L93 Difference]: Finished difference Result 405 states and 530 transitions. [2021-11-06 00:37:41,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:37:41,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-06 00:37:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:41,939 INFO L225 Difference]: With dead ends: 405 [2021-11-06 00:37:41,939 INFO L226 Difference]: Without dead ends: 209 [2021-11-06 00:37:41,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.30ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:37:41,941 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 244 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.22ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.84ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:41,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 477 Invalid, 69 Unknown, 0 Unchecked, 1.22ms Time], IncrementalHoareTripleChecker [30 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 66.84ms Time] [2021-11-06 00:37:41,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-11-06 00:37:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 203. [2021-11-06 00:37:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 197 states have (on average 1.299492385786802) internal successors, (256), 202 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 256 transitions. [2021-11-06 00:37:41,948 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 256 transitions. Word has length 64 [2021-11-06 00:37:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:41,948 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 256 transitions. [2021-11-06 00:37:41,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 256 transitions. [2021-11-06 00:37:41,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 00:37:41,950 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:41,950 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:41,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-06 00:37:42,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:37:42,160 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:42,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1012352744, now seen corresponding path program 1 times [2021-11-06 00:37:42,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:37:42,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042500956] [2021-11-06 00:37:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:42,162 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:37:42,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:37:42,163 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:37:42,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-06 00:37:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:42,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:37:42,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:42,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:37:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:42,861 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:37:42,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042500956] [2021-11-06 00:37:42,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042500956] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:42,861 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:42,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 00:37:42,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162888005] [2021-11-06 00:37:42,861 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:42,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:37:42,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:37:42,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:37:42,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:37:42,862 INFO L87 Difference]: Start difference. First operand 203 states and 256 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:43,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:43,725 INFO L93 Difference]: Finished difference Result 533 states and 671 transitions. [2021-11-06 00:37:43,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:37:43,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-06 00:37:43,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:43,727 INFO L225 Difference]: With dead ends: 533 [2021-11-06 00:37:43,727 INFO L226 Difference]: Without dead ends: 334 [2021-11-06 00:37:43,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.57ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:37:43,728 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 128 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 811.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.36ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 850.17ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:43,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 532 Invalid, 36 Unknown, 0 Unchecked, 1.36ms Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 850.17ms Time] [2021-11-06 00:37:43,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-06 00:37:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 306. [2021-11-06 00:37:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 300 states have (on average 1.2833333333333334) internal successors, (385), 305 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 385 transitions. [2021-11-06 00:37:43,737 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 385 transitions. Word has length 64 [2021-11-06 00:37:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:43,738 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 385 transitions. [2021-11-06 00:37:43,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 385 transitions. [2021-11-06 00:37:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 00:37:43,740 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:43,740 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:43,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-06 00:37:43,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:37:43,951 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:43,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:43,951 INFO L85 PathProgramCache]: Analyzing trace with hash -147792665, now seen corresponding path program 1 times [2021-11-06 00:37:43,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:37:43,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567299791] [2021-11-06 00:37:43,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:43,952 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:37:43,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:37:43,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:37:43,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-06 00:37:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:44,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:37:44,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:44,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:37:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:37:44,376 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:37:44,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567299791] [2021-11-06 00:37:44,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567299791] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:44,376 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:44,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:37:44,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099925682] [2021-11-06 00:37:44,377 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:44,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:37:44,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:37:44,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:37:44,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:37:44,378 INFO L87 Difference]: Start difference. First operand 306 states and 385 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:44,443 INFO L93 Difference]: Finished difference Result 570 states and 727 transitions. [2021-11-06 00:37:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:37:44,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-06 00:37:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:44,445 INFO L225 Difference]: With dead ends: 570 [2021-11-06 00:37:44,445 INFO L226 Difference]: Without dead ends: 309 [2021-11-06 00:37:44,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.60ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:37:44,446 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.90ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.74ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:44,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 724 Invalid, 20 Unknown, 0 Unchecked, 0.90ms Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 56.74ms Time] [2021-11-06 00:37:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-11-06 00:37:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2021-11-06 00:37:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 303 states have (on average 1.2805280528052805) internal successors, (388), 308 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 388 transitions. [2021-11-06 00:37:44,453 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 388 transitions. Word has length 71 [2021-11-06 00:37:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:44,454 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 388 transitions. [2021-11-06 00:37:44,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:44,454 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 388 transitions. [2021-11-06 00:37:44,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-06 00:37:44,455 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:44,455 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:44,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-06 00:37:44,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:37:44,666 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:44,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:44,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1065048653, now seen corresponding path program 1 times [2021-11-06 00:37:44,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:37:44,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465484295] [2021-11-06 00:37:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:44,668 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:37:44,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:37:44,683 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:37:44,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-06 00:37:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:44,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:37:44,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-06 00:37:44,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:37:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-06 00:37:45,143 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:37:45,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465484295] [2021-11-06 00:37:45,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465484295] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:37:45,144 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:37:45,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-06 00:37:45,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685872755] [2021-11-06 00:37:45,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:37:45,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 00:37:45,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:37:45,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 00:37:45,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:37:45,145 INFO L87 Difference]: Start difference. First operand 309 states and 388 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:45,390 INFO L93 Difference]: Finished difference Result 579 states and 739 transitions. [2021-11-06 00:37:45,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 00:37:45,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-11-06 00:37:45,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:45,392 INFO L225 Difference]: With dead ends: 579 [2021-11-06 00:37:45,392 INFO L226 Difference]: Without dead ends: 315 [2021-11-06 00:37:45,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 136.19ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-06 00:37:45,393 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 140.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.34ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 158.37ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:45,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 963 Invalid, 50 Unknown, 0 Unchecked, 1.34ms Time], IncrementalHoareTripleChecker [13 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 158.37ms Time] [2021-11-06 00:37:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-11-06 00:37:45,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2021-11-06 00:37:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 309 states have (on average 1.2750809061488673) internal successors, (394), 314 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 394 transitions. [2021-11-06 00:37:45,407 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 394 transitions. Word has length 74 [2021-11-06 00:37:45,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:45,407 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 394 transitions. [2021-11-06 00:37:45,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:45,407 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 394 transitions. [2021-11-06 00:37:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-06 00:37:45,408 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:45,408 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:45,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-06 00:37:45,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:37:45,620 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:45,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1820271245, now seen corresponding path program 2 times [2021-11-06 00:37:45,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:37:45,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090907007] [2021-11-06 00:37:45,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:37:45,621 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:37:45,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:37:45,636 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:37:45,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-06 00:37:45,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 00:37:45,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:37:45,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:37:45,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:45,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-06 00:37:45,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-06 00:37:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-06 00:37:45,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:37:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-06 00:37:45,959 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:37:45,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090907007] [2021-11-06 00:37:45,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090907007] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:45,960 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:45,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 00:37:45,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25862423] [2021-11-06 00:37:45,961 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:45,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 00:37:45,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:37:45,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 00:37:45,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:37:45,961 INFO L87 Difference]: Start difference. First operand 315 states and 394 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:47,941 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:37:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:49,329 INFO L93 Difference]: Finished difference Result 490 states and 625 transitions. [2021-11-06 00:37:49,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 00:37:49,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-06 00:37:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:49,331 INFO L225 Difference]: With dead ends: 490 [2021-11-06 00:37:49,331 INFO L226 Difference]: Without dead ends: 465 [2021-11-06 00:37:49,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.73ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:37:49,332 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 207 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3098.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.58ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3326.82ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:49,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 830 Invalid, 238 Unknown, 0 Unchecked, 3.58ms Time], IncrementalHoareTripleChecker [6 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 3326.82ms Time] [2021-11-06 00:37:49,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-11-06 00:37:49,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 386. [2021-11-06 00:37:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 385 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 490 transitions. [2021-11-06 00:37:49,341 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 490 transitions. Word has length 80 [2021-11-06 00:37:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:49,341 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 490 transitions. [2021-11-06 00:37:49,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 490 transitions. [2021-11-06 00:37:49,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-06 00:37:49,342 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:49,342 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:49,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-06 00:37:49,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:37:49,550 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:49,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1224331210, now seen corresponding path program 1 times [2021-11-06 00:37:49,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:37:49,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174576178] [2021-11-06 00:37:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:49,552 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:37:49,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:37:49,553 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:37:49,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-06 00:37:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:49,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 00:37:49,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:37:49,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:37:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:37:50,397 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:37:50,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174576178] [2021-11-06 00:37:50,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174576178] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:37:50,397 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:37:50,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-11-06 00:37:50,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885033130] [2021-11-06 00:37:50,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:37:50,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 00:37:50,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:37:50,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 00:37:50,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-06 00:37:50,398 INFO L87 Difference]: Start difference. First operand 386 states and 490 transitions. Second operand has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:51,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:51,780 INFO L93 Difference]: Finished difference Result 739 states and 955 transitions. [2021-11-06 00:37:51,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 00:37:51,781 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-11-06 00:37:51,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:51,782 INFO L225 Difference]: With dead ends: 739 [2021-11-06 00:37:51,783 INFO L226 Difference]: Without dead ends: 398 [2021-11-06 00:37:51,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 720.97ms TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2021-11-06 00:37:51,784 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 864.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.60ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 917.83ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:51,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1919 Invalid, 162 Unknown, 0 Unchecked, 2.60ms Time], IncrementalHoareTripleChecker [45 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 917.83ms Time] [2021-11-06 00:37:51,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-11-06 00:37:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2021-11-06 00:37:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 392 states have (on average 1.280612244897959) internal successors, (502), 397 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 502 transitions. [2021-11-06 00:37:51,796 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 502 transitions. Word has length 112 [2021-11-06 00:37:51,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:51,796 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 502 transitions. [2021-11-06 00:37:51,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:51,797 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 502 transitions. [2021-11-06 00:37:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-06 00:37:51,804 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:51,804 INFO L514 BasicCegarLoop]: trace histogram [14, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:51,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-06 00:37:52,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:37:52,016 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:52,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:52,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2016870474, now seen corresponding path program 2 times [2021-11-06 00:37:52,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:37:52,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779666700] [2021-11-06 00:37:52,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:37:52,018 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:37:52,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:37:52,018 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:37:52,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-06 00:37:52,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 00:37:52,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:37:52,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:37:52,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-06 00:37:52,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:37:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-06 00:37:52,507 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:37:52,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779666700] [2021-11-06 00:37:52,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779666700] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:37:52,507 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:37:52,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:37:52,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443233829] [2021-11-06 00:37:52,507 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:37:52,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:37:52,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:37:52,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:37:52,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:37:52,508 INFO L87 Difference]: Start difference. First operand 398 states and 502 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:37:52,595 INFO L93 Difference]: Finished difference Result 645 states and 838 transitions. [2021-11-06 00:37:52,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:37:52,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2021-11-06 00:37:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:37:52,598 INFO L225 Difference]: With dead ends: 645 [2021-11-06 00:37:52,598 INFO L226 Difference]: Without dead ends: 410 [2021-11-06 00:37:52,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.27ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:37:52,600 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 249 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.88ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 73.08ms IncrementalHoareTripleChecker+Time [2021-11-06 00:37:52,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 547 Invalid, 74 Unknown, 0 Unchecked, 0.88ms Time], IncrementalHoareTripleChecker [37 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 73.08ms Time] [2021-11-06 00:37:52,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-06 00:37:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2021-11-06 00:37:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 401 states have (on average 1.2144638403990025) internal successors, (487), 406 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 487 transitions. [2021-11-06 00:37:52,623 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 487 transitions. Word has length 124 [2021-11-06 00:37:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:37:52,623 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 487 transitions. [2021-11-06 00:37:52,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:37:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 487 transitions. [2021-11-06 00:37:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-06 00:37:52,624 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:37:52,624 INFO L514 BasicCegarLoop]: trace histogram [14, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:37:52,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-06 00:37:52,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:37:52,827 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:37:52,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:37:52,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1333208362, now seen corresponding path program 1 times [2021-11-06 00:37:52,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:37:52,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463054876] [2021-11-06 00:37:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:37:52,828 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:37:52,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:37:52,829 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:37:52,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-06 00:37:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:37:53,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-06 00:37:53,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:37:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-06 00:37:53,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:37:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-06 00:37:54,544 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:37:54,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463054876] [2021-11-06 00:37:54,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463054876] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:37:54,544 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:37:54,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-11-06 00:37:54,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854280742] [2021-11-06 00:37:54,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:37:54,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-06 00:37:54,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:37:54,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-06 00:37:54,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2021-11-06 00:37:54,547 INFO L87 Difference]: Start difference. First operand 407 states and 487 transitions. Second operand has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:38:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:38:02,287 INFO L93 Difference]: Finished difference Result 793 states and 973 transitions. [2021-11-06 00:38:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-06 00:38:02,287 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2021-11-06 00:38:02,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:38:02,288 INFO L225 Difference]: With dead ends: 793 [2021-11-06 00:38:02,288 INFO L226 Difference]: Without dead ends: 431 [2021-11-06 00:38:02,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 3447.35ms TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2021-11-06 00:38:02,290 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 3648 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5074.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3883 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.27ms SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5224.44ms IncrementalHoareTripleChecker+Time [2021-11-06 00:38:02,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3883 Invalid, 533 Unknown, 0 Unchecked, 4.27ms Time], IncrementalHoareTripleChecker [157 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 5224.44ms Time] [2021-11-06 00:38:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-11-06 00:38:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2021-11-06 00:38:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 425 states have (on average 1.2023529411764706) internal successors, (511), 430 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:38:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 511 transitions. [2021-11-06 00:38:02,299 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 511 transitions. Word has length 124 [2021-11-06 00:38:02,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:38:02,299 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 511 transitions. [2021-11-06 00:38:02,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:38:02,299 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 511 transitions. [2021-11-06 00:38:02,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-06 00:38:02,300 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:38:02,300 INFO L514 BasicCegarLoop]: trace histogram [30, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:38:02,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-06 00:38:02,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:38:02,501 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:38:02,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:38:02,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2039593942, now seen corresponding path program 2 times [2021-11-06 00:38:02,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:38:02,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127771994] [2021-11-06 00:38:02,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:38:02,502 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:38:02,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:38:02,503 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:38:02,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-06 00:38:02,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 00:38:02,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:38:02,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:38:02,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:38:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2021-11-06 00:38:02,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:38:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2021-11-06 00:38:03,074 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:38:03,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127771994] [2021-11-06 00:38:03,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127771994] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:38:03,075 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:38:03,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 5] imperfect sequences [] total 5 [2021-11-06 00:38:03,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159960185] [2021-11-06 00:38:03,075 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:38:03,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:38:03,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:38:03,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:38:03,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:38:03,076 INFO L87 Difference]: Start difference. First operand 431 states and 511 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:38:03,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:38:03,131 INFO L93 Difference]: Finished difference Result 653 states and 785 transitions. [2021-11-06 00:38:03,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:38:03,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2021-11-06 00:38:03,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:38:03,142 INFO L225 Difference]: With dead ends: 653 [2021-11-06 00:38:03,142 INFO L226 Difference]: Without dead ends: 434 [2021-11-06 00:38:03,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.91ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:38:03,143 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 3 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.55ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.35ms IncrementalHoareTripleChecker+Time [2021-11-06 00:38:03,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 647 Invalid, 64 Unknown, 0 Unchecked, 0.55ms Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 42.35ms Time] [2021-11-06 00:38:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-11-06 00:38:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2021-11-06 00:38:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 425 states have (on average 1.1811764705882353) internal successors, (502), 430 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:38:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 502 transitions. [2021-11-06 00:38:03,154 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 502 transitions. Word has length 148 [2021-11-06 00:38:03,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:38:03,154 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 502 transitions. [2021-11-06 00:38:03,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:38:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 502 transitions. [2021-11-06 00:38:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-06 00:38:03,155 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:38:03,156 INFO L514 BasicCegarLoop]: trace histogram [30, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:38:03,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-06 00:38:03,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:38:03,364 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:38:03,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:38:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1997207916, now seen corresponding path program 1 times [2021-11-06 00:38:03,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:38:03,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957940802] [2021-11-06 00:38:03,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:38:03,366 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:38:03,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:38:03,367 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:38:03,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-06 00:38:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:38:03,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-06 00:38:03,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:38:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 2 proven. 465 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-11-06 00:38:04,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:38:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 2 proven. 465 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-11-06 00:38:06,907 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:38:06,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957940802] [2021-11-06 00:38:06,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957940802] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:38:06,907 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:38:06,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2021-11-06 00:38:06,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255396497] [2021-11-06 00:38:06,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:38:06,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-11-06 00:38:06,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:38:06,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-11-06 00:38:06,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=933, Invalid=3099, Unknown=0, NotChecked=0, Total=4032 [2021-11-06 00:38:06,916 INFO L87 Difference]: Start difference. First operand 431 states and 502 transitions. Second operand has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:39:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:39:12,838 INFO L93 Difference]: Finished difference Result 847 states and 1015 transitions. [2021-11-06 00:39:12,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-11-06 00:39:12,839 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2021-11-06 00:39:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:39:12,841 INFO L225 Difference]: With dead ends: 847 [2021-11-06 00:39:12,841 INFO L226 Difference]: Without dead ends: 461 [2021-11-06 00:39:12,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 26218.60ms TimeCoverageRelationStatistics Valid=2700, Invalid=6042, Unknown=0, NotChecked=0, Total=8742 [2021-11-06 00:39:12,844 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 7980 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41596.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8215 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.36ms SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42260.36ms IncrementalHoareTripleChecker+Time [2021-11-06 00:39:12,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8215 Invalid, 1698 Unknown, 0 Unchecked, 14.36ms Time], IncrementalHoareTripleChecker [555 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 42260.36ms Time] [2021-11-06 00:39:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-11-06 00:39:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2021-11-06 00:39:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 455 states have (on average 1.1692307692307693) internal successors, (532), 460 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:39:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 532 transitions. [2021-11-06 00:39:12,856 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 532 transitions. Word has length 148 [2021-11-06 00:39:12,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:39:12,857 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 532 transitions. [2021-11-06 00:39:12,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:39:12,857 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 532 transitions. [2021-11-06 00:39:12,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-06 00:39:12,858 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:39:12,858 INFO L514 BasicCegarLoop]: trace histogram [44, 31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:39:12,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-11-06 00:39:13,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:39:13,072 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:39:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:39:13,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1100843980, now seen corresponding path program 2 times [2021-11-06 00:39:13,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:39:13,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109817971] [2021-11-06 00:39:13,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:39:13,073 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:39:13,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:39:13,074 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:39:13,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-06 00:39:13,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 00:39:13,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:39:13,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-06 00:39:13,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:39:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 2 proven. 496 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:39:14,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:39:18,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 2 proven. 496 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:39:18,305 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:39:18,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109817971] [2021-11-06 00:39:18,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109817971] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:39:18,305 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:39:18,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2021-11-06 00:39:18,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69263547] [2021-11-06 00:39:18,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:39:18,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-11-06 00:39:18,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:39:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-11-06 00:39:18,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2021-11-06 00:39:18,308 INFO L87 Difference]: Start difference. First operand 461 states and 532 transitions. Second operand has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:40:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:40:34,968 INFO L93 Difference]: Finished difference Result 910 states and 1081 transitions. [2021-11-06 00:40:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-06 00:40:34,969 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2021-11-06 00:40:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:40:34,970 INFO L225 Difference]: With dead ends: 910 [2021-11-06 00:40:34,970 INFO L226 Difference]: Without dead ends: 494 [2021-11-06 00:40:34,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 32147.34ms TimeCoverageRelationStatistics Valid=3199, Invalid=6113, Unknown=0, NotChecked=0, Total=9312 [2021-11-06 00:40:34,973 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 7296 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47211.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7531 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.97ms SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48073.05ms IncrementalHoareTripleChecker+Time [2021-11-06 00:40:34,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 7531 Invalid, 1930 Unknown, 0 Unchecked, 24.97ms Time], IncrementalHoareTripleChecker [591 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 48073.05ms Time] [2021-11-06 00:40:34,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-11-06 00:40:34,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2021-11-06 00:40:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 488 states have (on average 1.1577868852459017) internal successors, (565), 493 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:40:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 565 transitions. [2021-11-06 00:40:34,998 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 565 transitions. Word has length 178 [2021-11-06 00:40:34,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:40:34,999 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 565 transitions. [2021-11-06 00:40:34,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:40:34,999 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 565 transitions. [2021-11-06 00:40:35,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-11-06 00:40:35,000 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:40:35,000 INFO L514 BasicCegarLoop]: trace histogram [64, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:40:35,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-06 00:40:35,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:40:35,220 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:40:35,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:40:35,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1145284768, now seen corresponding path program 3 times [2021-11-06 00:40:35,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:40:35,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850422996] [2021-11-06 00:40:35,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-06 00:40:35,221 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:40:35,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:40:35,223 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:40:35,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-06 00:40:35,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-06 00:40:35,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:40:35,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:40:35,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:40:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3070 trivial. 0 not checked. [2021-11-06 00:40:35,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:40:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3070 trivial. 0 not checked. [2021-11-06 00:40:36,266 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:40:36,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850422996] [2021-11-06 00:40:36,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850422996] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:40:36,266 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:40:36,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 00:40:36,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297914541] [2021-11-06 00:40:36,267 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:40:36,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:40:36,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:40:36,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:40:36,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:40:36,268 INFO L87 Difference]: Start difference. First operand 494 states and 565 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:40:38,416 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:40:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:40:38,949 INFO L93 Difference]: Finished difference Result 1070 states and 1232 transitions. [2021-11-06 00:40:38,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 00:40:38,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2021-11-06 00:40:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:40:38,952 INFO L225 Difference]: With dead ends: 1070 [2021-11-06 00:40:38,952 INFO L226 Difference]: Without dead ends: 621 [2021-11-06 00:40:38,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.14ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:40:38,953 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 476 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2512.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.96ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2654.12ms IncrementalHoareTripleChecker+Time [2021-11-06 00:40:38,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [476 Valid, 441 Invalid, 86 Unknown, 0 Unchecked, 0.96ms Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 1 Unknown, 0 Unchecked, 2654.12ms Time] [2021-11-06 00:40:38,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-11-06 00:40:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 569. [2021-11-06 00:40:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 563 states have (on average 1.1580817051509769) internal successors, (652), 568 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:40:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 652 transitions. [2021-11-06 00:40:38,991 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 652 transitions. Word has length 211 [2021-11-06 00:40:38,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:40:38,992 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 652 transitions. [2021-11-06 00:40:38,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:40:38,992 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 652 transitions. [2021-11-06 00:40:38,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-06 00:40:38,993 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:40:38,993 INFO L514 BasicCegarLoop]: trace histogram [64, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:40:39,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-06 00:40:39,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:40:39,204 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:40:39,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:40:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash 670931834, now seen corresponding path program 1 times [2021-11-06 00:40:39,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:40:39,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918013180] [2021-11-06 00:40:39,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:40:39,207 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:40:39,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:40:39,208 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:40:39,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-06 00:40:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:40:40,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-06 00:40:40,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:40:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 2080 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:40:42,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:40:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 2080 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:40:53,958 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:40:53,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918013180] [2021-11-06 00:40:53,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918013180] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:40:53,958 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:40:53,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 132 [2021-11-06 00:40:53,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815790218] [2021-11-06 00:40:53,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:40:53,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2021-11-06 00:40:53,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:40:53,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2021-11-06 00:40:53,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4486, Invalid=12806, Unknown=0, NotChecked=0, Total=17292 [2021-11-06 00:40:53,962 INFO L87 Difference]: Start difference. First operand 569 states and 652 transitions. Second operand has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:44:35,594 WARN L230 SmtUtils]: Spent 5.87s on a formula simplification that was a NOOP. DAG size: 196 [2021-11-06 00:44:43,763 WARN L230 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 193 [2021-11-06 00:45:14,079 WARN L230 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 181 [2021-11-06 00:46:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:46:47,758 INFO L93 Difference]: Finished difference Result 1045 states and 1271 transitions. [2021-11-06 00:46:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-11-06 00:46:47,759 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2021-11-06 00:46:47,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:46:47,792 INFO L225 Difference]: With dead ends: 1045 [2021-11-06 00:46:47,793 INFO L226 Difference]: Without dead ends: 635 [2021-11-06 00:46:47,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1995 ImplicationChecksByTransitivity, 244351.43ms TimeCoverageRelationStatistics Valid=12934, Invalid=25286, Unknown=0, NotChecked=0, Total=38220 [2021-11-06 00:46:47,801 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 15276 mSDsCounter, 0 mSdLazyCounter, 4781 mSolverCounterSat, 1119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 119086.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15511 SdHoareTripleChecker+Invalid, 5900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 37.16ms SdHoareTripleChecker+Time, 1119 IncrementalHoareTripleChecker+Valid, 4781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 121839.80ms IncrementalHoareTripleChecker+Time [2021-11-06 00:46:47,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 15511 Invalid, 5900 Unknown, 0 Unchecked, 37.16ms Time], IncrementalHoareTripleChecker [1119 Valid, 4781 Invalid, 0 Unknown, 0 Unchecked, 121839.80ms Time] [2021-11-06 00:46:47,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-11-06 00:46:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2021-11-06 00:46:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 629 states have (on average 1.1414944356120826) internal successors, (718), 634 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:46:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 718 transitions. [2021-11-06 00:46:47,852 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 718 transitions. Word has length 218 [2021-11-06 00:46:47,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:46:47,852 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 718 transitions. [2021-11-06 00:46:47,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:46:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 718 transitions. [2021-11-06 00:46:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2021-11-06 00:46:47,862 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:46:47,862 INFO L514 BasicCegarLoop]: trace histogram [130, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:46:47,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-06 00:46:48,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:46:48,080 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 00:46:48,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:46:48,080 INFO L85 PathProgramCache]: Analyzing trace with hash 249759226, now seen corresponding path program 2 times [2021-11-06 00:46:48,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:46:48,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881124538] [2021-11-06 00:46:48,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:46:48,081 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:46:48,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:46:48,088 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:46:48,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-06 00:46:49,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 00:46:49,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:46:49,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 133 conjunts are in the unsatisfiable core [2021-11-06 00:46:49,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:46:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9507 backedges. 2 proven. 8515 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:46:59,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:47:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9507 backedges. 2 proven. 8515 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:47:42,934 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:47:42,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881124538] [2021-11-06 00:47:42,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881124538] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:47:42,935 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:47:42,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 264 [2021-11-06 00:47:42,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790424938] [2021-11-06 00:47:42,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:47:42,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 264 states [2021-11-06 00:47:42,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:47:42,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 264 interpolants. [2021-11-06 00:47:42,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17686, Invalid=51746, Unknown=0, NotChecked=0, Total=69432 [2021-11-06 00:47:42,970 INFO L87 Difference]: Start difference. First operand 635 states and 718 transitions. Second operand has 264 states, 264 states have (on average 1.4128787878787878) internal successors, (373), 264 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Killed by 15