./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-064368f-1-111_1a-drivers--media--radio--si4713-i2c.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c36dfa3b 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/ldv-validator-v0.8/linux-stable-064368f-1-111_1a-drivers--media--radio--si4713-i2c.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 271771768c3380f5979c29c79a53c5e282857dcb6c4c2b744d0fa4e6e2c0dd66 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-04 05:24:39,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 05:24:39,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 05:24:39,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 05:24:39,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 05:24:39,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 05:24:39,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 05:24:39,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 05:24:39,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 05:24:39,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 05:24:39,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 05:24:39,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 05:24:39,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 05:24:39,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 05:24:39,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 05:24:39,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 05:24:39,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 05:24:39,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 05:24:39,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 05:24:39,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 05:24:39,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 05:24:39,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 05:24:39,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 05:24:39,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 05:24:39,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 05:24:39,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 05:24:39,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 05:24:39,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 05:24:39,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 05:24:39,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 05:24:39,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 05:24:39,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 05:24:39,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 05:24:39,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 05:24:39,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 05:24:39,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 05:24:39,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 05:24:39,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 05:24:39,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 05:24:39,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 05:24:39,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 05:24:39,519 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-04 05:24:39,539 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 05:24:39,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 05:24:39,539 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 05:24:39,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 05:24:39,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 05:24:39,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 05:24:39,541 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 05:24:39,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 05:24:39,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-04 05:24:39,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 05:24:39,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 05:24:39,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 05:24:39,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 05:24:39,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 05:24:39,541 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 05:24:39,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 05:24:39,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 05:24:39,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 05:24:39,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 05:24:39,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 05:24:39,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 05:24:39,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 05:24:39,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 05:24:39,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-04 05:24:39,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-04 05:24:39,543 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 05:24:39,543 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 05:24:39,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 05:24:39,544 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 05:24:39,544 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 271771768c3380f5979c29c79a53c5e282857dcb6c4c2b744d0fa4e6e2c0dd66 [2021-11-04 05:24:39,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 05:24:39,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 05:24:39,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 05:24:39,722 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 05:24:39,723 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 05:24:39,724 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-064368f-1-111_1a-drivers--media--radio--si4713-i2c.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-11-04 05:24:39,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b74bcee/2f37220c2dbb4b0889ff07bc93811b45/FLAGf4a7cccb4 [2021-11-04 05:24:40,411 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 05:24:40,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-064368f-1-111_1a-drivers--media--radio--si4713-i2c.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-11-04 05:24:40,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b74bcee/2f37220c2dbb4b0889ff07bc93811b45/FLAGf4a7cccb4 [2021-11-04 05:24:40,800 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b74bcee/2f37220c2dbb4b0889ff07bc93811b45 [2021-11-04 05:24:40,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 05:24:40,804 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 05:24:40,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 05:24:40,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 05:24:40,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 05:24:40,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 05:24:40" (1/1) ... [2021-11-04 05:24:40,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345c79b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:24:40, skipping insertion in model container [2021-11-04 05:24:40,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 05:24:40" (1/1) ... [2021-11-04 05:24:40,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 05:24:40,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 05:24:41,971 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/ldv-validator-v0.8/linux-stable-064368f-1-111_1a-drivers--media--radio--si4713-i2c.ko-entry_point_ldv-val-v0.8.cil.out.i[185985,185998] [2021-11-04 05:24:41,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 05:24:42,015 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 05:24:42,248 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/ldv-validator-v0.8/linux-stable-064368f-1-111_1a-drivers--media--radio--si4713-i2c.ko-entry_point_ldv-val-v0.8.cil.out.i[185985,185998] [2021-11-04 05:24:42,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 05:24:42,357 INFO L208 MainTranslator]: Completed translation [2021-11-04 05:24:42,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:24:42 WrapperNode [2021-11-04 05:24:42,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 05:24:42,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 05:24:42,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 05:24:42,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 05:24:42,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:24:42" (1/1) ... [2021-11-04 05:24:42,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:24:42" (1/1) ... [2021-11-04 05:24:42,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 05:24:42,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 05:24:42,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 05:24:42,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 05:24:42,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:24:42" (1/1) ... [2021-11-04 05:24:42,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:24:42" (1/1) ... [2021-11-04 05:24:43,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:24:42" (1/1) ... [2021-11-04 05:24:43,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:24:42" (1/1) ... [2021-11-04 05:24:43,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:24:42" (1/1) ... [2021-11-04 05:24:43,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:24:42" (1/1) ... [2021-11-04 05:24:43,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:24:42" (1/1) ... [2021-11-04 05:24:43,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 05:24:43,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 05:24:43,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 05:24:43,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 05:24:43,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:24:42" (1/1) ... [2021-11-04 05:24:43,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 05:24:44,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 05:24:44,026 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-04 05:24:44,032 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-04 05:24:44,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-04 05:24:44,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-04 05:24:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-04 05:24:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-04 05:24:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-04 05:24:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 05:24:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 05:24:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 05:24:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 05:24:44,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 05:24:44,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 05:24:44,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-04 05:24:44,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-04 05:24:44,055 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-11-04 05:24:44,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 05:24:44,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 05:24:49,894 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 05:24:49,894 INFO L299 CfgBuilder]: Removed 3233 assume(true) statements. [2021-11-04 05:24:49,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 05:24:49 BoogieIcfgContainer [2021-11-04 05:24:49,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 05:24:49,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 05:24:49,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 05:24:49,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 05:24:49,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 05:24:40" (1/3) ... [2021-11-04 05:24:49,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e2fb78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 05:24:49, skipping insertion in model container [2021-11-04 05:24:49,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:24:42" (2/3) ... [2021-11-04 05:24:49,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e2fb78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 05:24:49, skipping insertion in model container [2021-11-04 05:24:49,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 05:24:49" (3/3) ... [2021-11-04 05:24:49,909 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-064368f-1-111_1a-drivers--media--radio--si4713-i2c.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-11-04 05:24:49,915 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 05:24:49,915 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-04 05:24:49,966 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 05:24:49,971 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-04 05:24:49,972 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-04 05:24:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 4726 states, 4719 states have (on average 1.5117609663064209) internal successors, (7134), 4725 states have internal predecessors, (7134), 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-04 05:24:50,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-04 05:24:50,053 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:24:50,053 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:24:50,054 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-04 05:24:50,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:24:50,058 INFO L85 PathProgramCache]: Analyzing trace with hash 7063654, now seen corresponding path program 1 times [2021-11-04 05:24:50,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:24:50,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616272688] [2021-11-04 05:24:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:24:50,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:24:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:24:50,458 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-04 05:24:50,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:24:50,460 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616272688] [2021-11-04 05:24:50,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616272688] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:24:50,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:24:50,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 05:24:50,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619367232] [2021-11-04 05:24:50,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:24:50,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-04 05:24:50,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:24:50,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-04 05:24:50,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-04 05:24:50,499 INFO L87 Difference]: Start difference. First operand has 4726 states, 4719 states have (on average 1.5117609663064209) internal successors, (7134), 4725 states have internal predecessors, (7134), 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 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-04 05:24:57,311 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:25:06,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:25:06,756 INFO L93 Difference]: Finished difference Result 9448 states and 14263 transitions. [2021-11-04 05:25:06,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-04 05:25:06,759 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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 42 [2021-11-04 05:25:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:25:06,794 INFO L225 Difference]: With dead ends: 9448 [2021-11-04 05:25:06,794 INFO L226 Difference]: Without dead ends: 4697 [2021-11-04 05:25:06,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-04 05:25:06,811 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7091 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14041.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.39ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15822.08ms IncrementalHoareTripleChecker+Time [2021-11-04 05:25:06,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 7091 Unknown, 0 Unchecked, 20.39ms Time], IncrementalHoareTripleChecker [0 Valid, 7091 Invalid, 0 Unknown, 0 Unchecked, 15822.08ms Time] [2021-11-04 05:25:06,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states. [2021-11-04 05:25:06,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 4697. [2021-11-04 05:25:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4697 states, 4691 states have (on average 1.5052227670006395) internal successors, (7061), 4696 states have internal predecessors, (7061), 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-04 05:25:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4697 states to 4697 states and 7061 transitions. [2021-11-04 05:25:06,988 INFO L78 Accepts]: Start accepts. Automaton has 4697 states and 7061 transitions. Word has length 42 [2021-11-04 05:25:06,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:25:06,988 INFO L470 AbstractCegarLoop]: Abstraction has 4697 states and 7061 transitions. [2021-11-04 05:25:06,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-04 05:25:06,989 INFO L276 IsEmpty]: Start isEmpty. Operand 4697 states and 7061 transitions. [2021-11-04 05:25:06,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-04 05:25:06,991 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:25:06,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:25:06,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-04 05:25:06,991 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-04 05:25:06,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:25:06,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1980709140, now seen corresponding path program 1 times [2021-11-04 05:25:06,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:25:06,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641419348] [2021-11-04 05:25:06,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:25:06,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:25:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:25:07,162 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-04 05:25:07,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:25:07,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641419348] [2021-11-04 05:25:07,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641419348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:25:07,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:25:07,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 05:25:07,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463682165] [2021-11-04 05:25:07,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:25:07,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 05:25:07,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:25:07,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 05:25:07,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:25:07,169 INFO L87 Difference]: Start difference. First operand 4697 states and 7061 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-04 05:25:19,347 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:25:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:25:34,777 INFO L93 Difference]: Finished difference Result 9379 states and 14107 transitions. [2021-11-04 05:25:34,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 05:25:34,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2021-11-04 05:25:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:25:34,819 INFO L225 Difference]: With dead ends: 9379 [2021-11-04 05:25:34,819 INFO L226 Difference]: Without dead ends: 4698 [2021-11-04 05:25:34,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.49ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:25:34,830 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 7052 mSDsCounter, 0 mSdLazyCounter, 14120 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24158.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 62.29ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14120 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27148.82ms IncrementalHoareTripleChecker+Time [2021-11-04 05:25:34,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 14121 Unknown, 0 Unchecked, 62.29ms Time], IncrementalHoareTripleChecker [0 Valid, 14120 Invalid, 1 Unknown, 0 Unchecked, 27148.82ms Time] [2021-11-04 05:25:34,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4698 states. [2021-11-04 05:25:34,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4698 to 4698. [2021-11-04 05:25:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4698 states, 4692 states have (on average 1.5051150895140666) internal successors, (7062), 4697 states have internal predecessors, (7062), 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-04 05:25:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4698 states to 4698 states and 7062 transitions. [2021-11-04 05:25:34,934 INFO L78 Accepts]: Start accepts. Automaton has 4698 states and 7062 transitions. Word has length 42 [2021-11-04 05:25:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:25:34,936 INFO L470 AbstractCegarLoop]: Abstraction has 4698 states and 7062 transitions. [2021-11-04 05:25:34,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-04 05:25:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 4698 states and 7062 transitions. [2021-11-04 05:25:34,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-04 05:25:34,941 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:25:34,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:25:34,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-04 05:25:34,943 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-04 05:25:34,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:25:34,943 INFO L85 PathProgramCache]: Analyzing trace with hash 839887901, now seen corresponding path program 1 times [2021-11-04 05:25:34,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:25:34,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147137962] [2021-11-04 05:25:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:25:34,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:25:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:25:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-04 05:25:35,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:25:35,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147137962] [2021-11-04 05:25:35,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147137962] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:25:35,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:25:35,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 05:25:35,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023793197] [2021-11-04 05:25:35,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:25:35,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 05:25:35,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:25:35,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 05:25:35,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:25:35,087 INFO L87 Difference]: Start difference. First operand 4698 states and 7062 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-04 05:25:36,232 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:06,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:26:06,730 INFO L93 Difference]: Finished difference Result 10103 states and 15158 transitions. [2021-11-04 05:26:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 05:26:06,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 43 [2021-11-04 05:26:06,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:26:06,750 INFO L225 Difference]: With dead ends: 10103 [2021-11-04 05:26:06,750 INFO L226 Difference]: Without dead ends: 5424 [2021-11-04 05:26:06,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.68ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:26:06,762 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1067 mSDsluCounter, 7021 mSDsCounter, 0 mSdLazyCounter, 14102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27595.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 51.58ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31136.81ms IncrementalHoareTripleChecker+Time [2021-11-04 05:26:06,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1067 Valid, 0 Invalid, 14104 Unknown, 0 Unchecked, 51.58ms Time], IncrementalHoareTripleChecker [2 Valid, 14102 Invalid, 0 Unknown, 0 Unchecked, 31136.81ms Time] [2021-11-04 05:26:06,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5424 states. [2021-11-04 05:26:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5424 to 5406. [2021-11-04 05:26:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5406 states, 5400 states have (on average 1.4994444444444444) internal successors, (8097), 5405 states have internal predecessors, (8097), 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-04 05:26:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5406 states to 5406 states and 8097 transitions. [2021-11-04 05:26:06,892 INFO L78 Accepts]: Start accepts. Automaton has 5406 states and 8097 transitions. Word has length 43 [2021-11-04 05:26:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:26:06,892 INFO L470 AbstractCegarLoop]: Abstraction has 5406 states and 8097 transitions. [2021-11-04 05:26:06,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-04 05:26:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 5406 states and 8097 transitions. [2021-11-04 05:26:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-04 05:26:06,897 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:26:06,898 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] [2021-11-04 05:26:06,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-04 05:26:06,898 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-04 05:26:06,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:26:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash 420553451, now seen corresponding path program 1 times [2021-11-04 05:26:06,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:26:06,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654185442] [2021-11-04 05:26:06,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:26:06,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:26:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:26:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-04 05:26:07,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:26:07,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654185442] [2021-11-04 05:26:07,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654185442] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 05:26:07,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885324325] [2021-11-04 05:26:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:26:07,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 05:26:07,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 05:26:07,126 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-04 05:26:07,128 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-04 05:26:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:26:07,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 1764 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-04 05:26:07,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 05:26:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-04 05:26:08,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 05:26:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-04 05:26:08,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885324325] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-04 05:26:08,203 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-04 05:26:08,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-11-04 05:26:08,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951637452] [2021-11-04 05:26:08,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-04 05:26:08,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-04 05:26:08,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:26:08,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-04 05:26:08,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2021-11-04 05:26:08,205 INFO L87 Difference]: Start difference. First operand 5406 states and 8097 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-04 05:26:10,845 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:12,187 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:19,367 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:21,389 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:23,420 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:27:08,537 INFO L93 Difference]: Finished difference Result 10806 states and 16198 transitions. [2021-11-04 05:27:08,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-04 05:27:08,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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 86 [2021-11-04 05:27:08,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:27:08,555 INFO L225 Difference]: With dead ends: 10806 [2021-11-04 05:27:08,556 INFO L226 Difference]: Without dead ends: 5417 [2021-11-04 05:27:08,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.78ms TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2021-11-04 05:27:08,576 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 21156 mSDsCounter, 0 mSdLazyCounter, 28240 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53402.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 62.71ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 28240 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59733.10ms IncrementalHoareTripleChecker+Time [2021-11-04 05:27:08,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 28264 Unknown, 0 Unchecked, 62.71ms Time], IncrementalHoareTripleChecker [22 Valid, 28240 Invalid, 2 Unknown, 0 Unchecked, 59733.10ms Time] [2021-11-04 05:27:08,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5417 states. [2021-11-04 05:27:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5417 to 5417. [2021-11-04 05:27:08,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5417 states, 5411 states have (on average 1.4984291258547404) internal successors, (8108), 5416 states have internal predecessors, (8108), 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-04 05:27:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5417 states to 5417 states and 8108 transitions. [2021-11-04 05:27:08,693 INFO L78 Accepts]: Start accepts. Automaton has 5417 states and 8108 transitions. Word has length 86 [2021-11-04 05:27:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:27:08,695 INFO L470 AbstractCegarLoop]: Abstraction has 5417 states and 8108 transitions. [2021-11-04 05:27:08,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-04 05:27:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 5417 states and 8108 transitions. [2021-11-04 05:27:08,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-04 05:27:08,699 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:27:08,700 INFO L514 BasicCegarLoop]: trace histogram [4, 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] [2021-11-04 05:27:08,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-04 05:27:08,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 05:27:08,906 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-04 05:27:08,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:27:08,906 INFO L85 PathProgramCache]: Analyzing trace with hash 962367612, now seen corresponding path program 2 times [2021-11-04 05:27:08,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:27:08,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772811298] [2021-11-04 05:27:08,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:27:08,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:27:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:27:09,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 05:27:09,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:27:09,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772811298] [2021-11-04 05:27:09,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772811298] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:27:09,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:27:09,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-04 05:27:09,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150070774] [2021-11-04 05:27:09,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:27:09,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-04 05:27:09,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:27:09,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-04 05:27:09,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-04 05:27:09,251 INFO L87 Difference]: Start difference. First operand 5417 states and 8108 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-04 05:27:12,730 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:14,506 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:24,656 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:25,857 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:28:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:28:27,593 INFO L93 Difference]: Finished difference Result 11396 states and 17017 transitions. [2021-11-04 05:28:27,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-04 05:28:27,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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 89 [2021-11-04 05:28:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:28:27,610 INFO L225 Difference]: With dead ends: 11396 [2021-11-04 05:28:27,610 INFO L226 Difference]: Without dead ends: 6001 [2021-11-04 05:28:27,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 88.19ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-11-04 05:28:27,616 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2151 mSDsluCounter, 30052 mSDsCounter, 0 mSdLazyCounter, 42963 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69592.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2151 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 43014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 84.22ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 42963 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77710.95ms IncrementalHoareTripleChecker+Time [2021-11-04 05:28:27,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2151 Valid, 0 Invalid, 43014 Unknown, 0 Unchecked, 84.22ms Time], IncrementalHoareTripleChecker [50 Valid, 42963 Invalid, 1 Unknown, 0 Unchecked, 77710.95ms Time] [2021-11-04 05:28:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2021-11-04 05:28:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 5784. [2021-11-04 05:28:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5784 states, 5778 states have (on average 1.4944617514710972) internal successors, (8635), 5783 states have internal predecessors, (8635), 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-04 05:28:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 8635 transitions. [2021-11-04 05:28:27,728 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 8635 transitions. Word has length 89 [2021-11-04 05:28:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:28:27,730 INFO L470 AbstractCegarLoop]: Abstraction has 5784 states and 8635 transitions. [2021-11-04 05:28:27,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-04 05:28:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 8635 transitions. [2021-11-04 05:28:27,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-04 05:28:27,735 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:28:27,736 INFO L514 BasicCegarLoop]: trace histogram [4, 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] [2021-11-04 05:28:27,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-04 05:28:27,736 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-04 05:28:27,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:28:27,737 INFO L85 PathProgramCache]: Analyzing trace with hash 85232559, now seen corresponding path program 1 times [2021-11-04 05:28:27,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:28:27,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424351442] [2021-11-04 05:28:27,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:28:27,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:28:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:28:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 05:28:27,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:28:27,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424351442] [2021-11-04 05:28:27,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424351442] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:28:27,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:28:27,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 05:28:27,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842146684] [2021-11-04 05:28:27,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:28:27,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 05:28:27,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:28:27,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 05:28:27,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:28:27,890 INFO L87 Difference]: Start difference. First operand 5784 states and 8635 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-04 05:28:30,207 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:28:35,270 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:29:18,732 INFO L93 Difference]: Finished difference Result 11286 states and 16893 transitions. [2021-11-04 05:29:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 05:29:18,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 91 [2021-11-04 05:29:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:29:18,754 INFO L225 Difference]: With dead ends: 11286 [2021-11-04 05:29:18,755 INFO L226 Difference]: Without dead ends: 11278 [2021-11-04 05:29:18,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.19ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:29:18,760 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7022 mSDsluCounter, 6725 mSDsCounter, 0 mSdLazyCounter, 20491 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43766.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7022 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 20500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 43.85ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20491 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50184.27ms IncrementalHoareTripleChecker+Time [2021-11-04 05:29:18,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7022 Valid, 0 Invalid, 20500 Unknown, 0 Unchecked, 43.85ms Time], IncrementalHoareTripleChecker [8 Valid, 20491 Invalid, 1 Unknown, 0 Unchecked, 50184.27ms Time] [2021-11-04 05:29:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11278 states. [2021-11-04 05:29:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11278 to 5776. [2021-11-04 05:29:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5776 states, 5774 states have (on average 1.493765154139245) internal successors, (8625), 5775 states have internal predecessors, (8625), 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-04 05:29:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5776 states to 5776 states and 8625 transitions. [2021-11-04 05:29:18,896 INFO L78 Accepts]: Start accepts. Automaton has 5776 states and 8625 transitions. Word has length 91 [2021-11-04 05:29:18,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:29:18,896 INFO L470 AbstractCegarLoop]: Abstraction has 5776 states and 8625 transitions. [2021-11-04 05:29:18,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-04 05:29:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 5776 states and 8625 transitions. [2021-11-04 05:29:18,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-04 05:29:18,907 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:29:18,907 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:29:18,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-04 05:29:18,908 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-04 05:29:18,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:29:18,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1977297443, now seen corresponding path program 1 times [2021-11-04 05:29:18,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:29:18,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263566418] [2021-11-04 05:29:18,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:29:18,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:29:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:29:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 05:29:19,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:29:19,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263566418] [2021-11-04 05:29:19,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263566418] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 05:29:19,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426095585] [2021-11-04 05:29:19,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:29:19,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 05:29:19,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 05:29:19,295 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-04 05:29:19,296 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-04 05:29:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:29:20,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 1892 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-04 05:29:20,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 05:29:20,540 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 143 treesize of output 119 [2021-11-04 05:29:20,545 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 119 treesize of output 95 [2021-11-04 05:29:20,581 INFO L354 Elim1Store]: treesize reduction 20, result has 60.8 percent of original size [2021-11-04 05:29:20,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 96 [2021-11-04 05:29:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-04 05:29:20,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-04 05:29:20,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426095585] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:29:20,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-04 05:29:20,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2021-11-04 05:29:20,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737377356] [2021-11-04 05:29:20,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:29:20,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 05:29:20,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:29:20,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 05:29:20,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2021-11-04 05:29:20,659 INFO L87 Difference]: Start difference. First operand 5776 states and 8625 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-04 05:29:23,190 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:24,721 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:26,898 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:37,439 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:38,444 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:40,469 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:30:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:30:57,080 INFO L93 Difference]: Finished difference Result 11531 states and 17230 transitions. [2021-11-04 05:30:57,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 05:30:57,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-04 05:30:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:30:57,093 INFO L225 Difference]: With dead ends: 11531 [2021-11-04 05:30:57,094 INFO L226 Difference]: Without dead ends: 5777 [2021-11-04 05:30:57,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 345.94ms TimeCoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2021-11-04 05:30:57,102 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 17253 mSDsCounter, 0 mSdLazyCounter, 28166 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 79464.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 111.95ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 28166 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 95602.04ms IncrementalHoareTripleChecker+Time [2021-11-04 05:30:57,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 28196 Unknown, 0 Unchecked, 111.95ms Time], IncrementalHoareTripleChecker [27 Valid, 28166 Invalid, 3 Unknown, 0 Unchecked, 95602.04ms Time] [2021-11-04 05:30:57,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5777 states. [2021-11-04 05:30:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5777 to 5777. [2021-11-04 05:30:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5777 states, 5775 states have (on average 1.4933333333333334) internal successors, (8624), 5776 states have internal predecessors, (8624), 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-04 05:30:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5777 states to 5777 states and 8624 transitions. [2021-11-04 05:30:57,193 INFO L78 Accepts]: Start accepts. Automaton has 5777 states and 8624 transitions. Word has length 103 [2021-11-04 05:30:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:30:57,194 INFO L470 AbstractCegarLoop]: Abstraction has 5777 states and 8624 transitions. [2021-11-04 05:30:57,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-04 05:30:57,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5777 states and 8624 transitions. [2021-11-04 05:30:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-04 05:30:57,199 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:30:57,199 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:30:57,223 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-04 05:30:57,422 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,SelfDestructingSolverStorable6 [2021-11-04 05:30:57,423 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-04 05:30:57,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:30:57,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2059504415, now seen corresponding path program 1 times [2021-11-04 05:30:57,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:30:57,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133125987] [2021-11-04 05:30:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:30:57,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:30:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:30:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 05:30:58,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:30:58,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133125987] [2021-11-04 05:30:58,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133125987] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 05:30:58,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527747967] [2021-11-04 05:30:58,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:30:58,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 05:30:58,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 05:30:58,081 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-04 05:30:58,082 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-04 05:30:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:30:58,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 1892 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-04 05:30:58,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 05:30:58,929 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-04 05:30:59,023 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-04 05:30:59,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-04 05:30:59,150 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [|ULTIMATE.start_ldv_init_zalloc_#t~malloc43.base|] [2021-11-04 05:30:59,150 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-04 05:30:59,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-11-04 05:30:59,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288908847] [2021-11-04 05:30:59,151 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-04 05:30:59,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-04 05:30:59,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:30:59,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-04 05:30:59,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-04 05:30:59,152 INFO L87 Difference]: Start difference. First operand 5777 states and 8624 transitions. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 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-04 05:31:01,118 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:03,139 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:04,892 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:07,122 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:09,367 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:11,359 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:13,558 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:38,914 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:41,222 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:44,723 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:47,135 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:25,942 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:27,962 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:33:21,817 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:34:15,285 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:36:08,703 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:36:10,630 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:36:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:36:51,741 INFO L93 Difference]: Finished difference Result 17708 states and 26412 transitions. [2021-11-04 05:36:51,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-04 05:36:51,742 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 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-04 05:36:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:36:51,761 INFO L225 Difference]: With dead ends: 17708 [2021-11-04 05:36:51,761 INFO L226 Difference]: Without dead ends: 11953 [2021-11-04 05:36:51,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 4533.45ms TimeCoverageRelationStatistics Valid=218, Invalid=838, Unknown=0, NotChecked=0, Total=1056 [2021-11-04 05:36:51,768 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 32224 mSDsluCounter, 69633 mSDsCounter, 0 mSdLazyCounter, 86745 mSolverCounterSat, 238 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 306522.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 32224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 86991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 408.14ms SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 86745 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 346462.45ms IncrementalHoareTripleChecker+Time [2021-11-04 05:36:51,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32224 Valid, 0 Invalid, 86991 Unknown, 0 Unchecked, 408.14ms Time], IncrementalHoareTripleChecker [238 Valid, 86745 Invalid, 8 Unknown, 0 Unchecked, 346462.45ms Time] [2021-11-04 05:36:51,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11953 states. [2021-11-04 05:36:51,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11953 to 6150. [2021-11-04 05:36:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6150 states, 6148 states have (on average 1.4892648015614833) internal successors, (9156), 6149 states have internal predecessors, (9156), 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-04 05:36:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6150 states to 6150 states and 9156 transitions. [2021-11-04 05:36:51,882 INFO L78 Accepts]: Start accepts. Automaton has 6150 states and 9156 transitions. Word has length 103 [2021-11-04 05:36:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:36:51,882 INFO L470 AbstractCegarLoop]: Abstraction has 6150 states and 9156 transitions. [2021-11-04 05:36:51,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 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-04 05:36:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states and 9156 transitions. [2021-11-04 05:36:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-04 05:36:51,887 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:36:51,887 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:36:51,911 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-04 05:36:52,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 05:36:52,109 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-04 05:36:52,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:36:52,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2033843576, now seen corresponding path program 1 times [2021-11-04 05:36:52,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:36:52,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220669561] [2021-11-04 05:36:52,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:36:52,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:36:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:36:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 05:36:52,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:36:52,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220669561] [2021-11-04 05:36:52,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220669561] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 05:36:52,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506354748] [2021-11-04 05:36:52,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:36:52,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 05:36:52,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 05:36:52,525 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-04 05:36:52,526 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-04 05:36:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:36:53,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 1875 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-04 05:36:53,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 05:36:53,557 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 14 treesize of output 10 [2021-11-04 05:36:53,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:36:53,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-04 05:36:53,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:36:53,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:36:53,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:36:53,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-04 05:36:54,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:36:54,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:36:54,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:36:54,177 INFO L354 Elim1Store]: treesize reduction 72, result has 26.5 percent of original size [2021-11-04 05:36:54,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 44 [2021-11-04 05:36:56,051 INFO L354 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2021-11-04 05:36:56,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2021-11-04 05:37:09,064 INFO L354 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2021-11-04 05:37:09,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 50 [2021-11-04 05:37:19,751 INFO L354 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2021-11-04 05:37:19,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 50 [2021-11-04 05:37:30,445 INFO L354 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2021-11-04 05:37:30,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 50 [2021-11-04 05:37:41,176 INFO L354 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2021-11-04 05:37:41,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 50 [2021-11-04 05:37:51,893 INFO L354 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2021-11-04 05:37:51,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 50 [2021-11-04 05:38:02,685 INFO L354 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2021-11-04 05:38:02,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 54 [2021-11-04 05:38:05,884 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-04 05:38:05,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 48 treesize of output 34 [2021-11-04 05:38:05,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-04 05:38:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 05:38:06,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 05:38:08,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24|) (not (= (+ 1071884608 (select (select (store |c_#memory_int| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24| ((as const (Array Int Int)) 0)) |c_ULTIMATE.start_main_~#ldvarg1~0.base|) |c_ULTIMATE.start_main_~#ldvarg1~0.offset|)) 0)))) is different from false [2021-11-04 05:38:10,223 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25|) (not (= (+ (select (select (let ((.cse0 ((as const (Array Int Int)) 0))) (store (store |c_#memory_int| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24| .cse0)) |c_ULTIMATE.start_main_~#ldvarg1~0.base|) |c_ULTIMATE.start_main_~#ldvarg1~0.offset|) 1071884608) 0)))) is different from false [2021-11-04 05:38:12,536 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_26| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25|) (not (= (+ (select (select (let ((.cse0 ((as const (Array Int Int)) 0))) (store (store (store |c_#memory_int| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_26| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24| .cse0)) |c_ULTIMATE.start_main_~#ldvarg1~0.base|) |c_ULTIMATE.start_main_~#ldvarg1~0.offset|) 1071884608) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_26|))) is different from false [2021-11-04 05:38:15,202 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_27| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_26| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_27|) (not (= (+ (select (select (let ((.cse0 ((as const (Array Int Int)) 0))) (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_27| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_26| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24| .cse0)) |c_ULTIMATE.start_main_~#ldvarg1~0.base|) |c_ULTIMATE.start_main_~#ldvarg1~0.offset|) 1071884608) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_26|))) is different from false [2021-11-04 05:38:18,282 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_27| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_26| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_28| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_27|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_28|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_26|) (not (= (+ 1071884608 (select (select (let ((.cse0 ((as const (Array Int Int)) 0))) (store (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_28| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_27| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_26| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24| .cse0)) |c_ULTIMATE.start_main_~#ldvarg1~0.base|) |c_ULTIMATE.start_main_~#ldvarg1~0.offset|)) 0)))) is different from false [2021-11-04 05:38:21,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_27| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_26| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_29| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_28| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_27|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_29|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_28|) (not (= (+ (select (select (let ((.cse0 ((as const (Array Int Int)) 0))) (store (store (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_29| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_28| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_27| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_26| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24| .cse0)) |c_ULTIMATE.start_main_~#ldvarg1~0.base|) |c_ULTIMATE.start_main_~#ldvarg1~0.offset|) 1071884608) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_26|))) is different from false [2021-11-04 05:38:26,359 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_27| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_26| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_29| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_28| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24| Int) (|v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_30| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_27|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_29|) (not (= (+ (select (select (let ((.cse0 ((as const (Array Int Int)) 0))) (store (store (store (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_30| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_29| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_28| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_27| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_26| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_25| .cse0) |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_24| .cse0)) |c_ULTIMATE.start_main_~#ldvarg1~0.base|) |c_ULTIMATE.start_main_~#ldvarg1~0.offset|) 1071884608) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_28|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_30|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_#Ultimate.meminit_#ptr.base_26|))) is different from false Killed by 15