./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.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 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 14:51:08,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 14:51:08,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 14:51:08,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 14:51:08,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 14:51:08,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 14:51:08,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 14:51:08,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 14:51:08,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 14:51:08,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 14:51:08,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 14:51:08,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 14:51:08,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 14:51:08,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 14:51:08,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 14:51:08,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 14:51:08,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 14:51:08,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 14:51:08,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 14:51:08,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 14:51:08,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 14:51:08,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 14:51:08,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 14:51:08,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 14:51:08,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 14:51:08,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 14:51:08,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 14:51:08,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 14:51:08,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 14:51:08,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 14:51:08,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 14:51:08,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 14:51:08,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 14:51:08,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 14:51:08,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 14:51:08,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 14:51:08,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 14:51:08,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 14:51:08,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 14:51:08,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 14:51:08,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 14:51:08,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-05 14:51:08,540 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 14:51:08,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 14:51:08,541 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 14:51:08,541 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 14:51:08,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 14:51:08,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 14:51:08,542 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 14:51:08,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 14:51:08,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-05 14:51:08,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 14:51:08,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 14:51:08,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 14:51:08,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 14:51:08,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 14:51:08,544 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 14:51:08,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 14:51:08,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 14:51:08,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 14:51:08,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 14:51:08,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 14:51:08,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 14:51:08,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 14:51:08,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 14:51:08,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-05 14:51:08,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-05 14:51:08,549 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 14:51:08,549 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 14:51:08,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 14:51:08,549 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 14:51:08,549 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 -> 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb [2021-11-05 14:51:08,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 14:51:08,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 14:51:08,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 14:51:08,806 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 14:51:08,806 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 14:51:08,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-05 14:51:08,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2beb204e9/5f4622fa6ff84f3c972a524bf37bc619/FLAG4b93de9e1 [2021-11-05 14:51:09,383 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 14:51:09,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-05 14:51:09,406 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2beb204e9/5f4622fa6ff84f3c972a524bf37bc619/FLAG4b93de9e1 [2021-11-05 14:51:09,579 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2beb204e9/5f4622fa6ff84f3c972a524bf37bc619 [2021-11-05 14:51:09,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 14:51:09,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 14:51:09,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 14:51:09,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 14:51:09,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 14:51:09,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 02:51:09" (1/1) ... [2021-11-05 14:51:09,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b24176f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:51:09, skipping insertion in model container [2021-11-05 14:51:09,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 02:51:09" (1/1) ... [2021-11-05 14:51:09,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 14:51:09,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 14:51:10,569 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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-05 14:51:10,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 14:51:10,594 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 14:51:10,770 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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-05 14:51:10,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 14:51:10,830 INFO L208 MainTranslator]: Completed translation [2021-11-05 14:51:10,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:51:10 WrapperNode [2021-11-05 14:51:10,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 14:51:10,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 14:51:10,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 14:51:10,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 14:51:10,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:51:10" (1/1) ... [2021-11-05 14:51:10,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:51:10" (1/1) ... [2021-11-05 14:51:11,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 14:51:11,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 14:51:11,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 14:51:11,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 14:51:11,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:51:10" (1/1) ... [2021-11-05 14:51:11,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:51:10" (1/1) ... [2021-11-05 14:51:11,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:51:10" (1/1) ... [2021-11-05 14:51:11,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:51:10" (1/1) ... [2021-11-05 14:51:11,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:51:10" (1/1) ... [2021-11-05 14:51:11,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:51:10" (1/1) ... [2021-11-05 14:51:11,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:51:10" (1/1) ... [2021-11-05 14:51:11,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 14:51:11,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 14:51:11,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 14:51:11,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 14:51:11,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:51:10" (1/1) ... [2021-11-05 14:51:11,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 14:51:11,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 14:51:11,304 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-05 14:51:11,308 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-05 14:51:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-05 14:51:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-11-05 14:51:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-05 14:51:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-05 14:51:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-05 14:51:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-05 14:51:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 14:51:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 14:51:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 14:51:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-05 14:51:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 14:51:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 14:51:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 14:51:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-05 14:51:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-05 14:51:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 14:51:11,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 14:51:13,968 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 14:51:13,968 INFO L299 CfgBuilder]: Removed 972 assume(true) statements. [2021-11-05 14:51:13,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 02:51:13 BoogieIcfgContainer [2021-11-05 14:51:13,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 14:51:13,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 14:51:13,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 14:51:13,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 14:51:13,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 02:51:09" (1/3) ... [2021-11-05 14:51:13,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1193746f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 02:51:13, skipping insertion in model container [2021-11-05 14:51:13,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:51:10" (2/3) ... [2021-11-05 14:51:13,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1193746f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 02:51:13, skipping insertion in model container [2021-11-05 14:51:13,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 02:51:13" (3/3) ... [2021-11-05 14:51:13,975 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-05 14:51:13,978 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 14:51:13,978 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-05 14:51:14,007 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 14:51:14,011 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-05 14:51:14,012 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-05 14:51:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 1042 states, 1040 states have (on average 1.4942307692307693) internal successors, (1554), 1041 states have internal predecessors, (1554), 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-05 14:51:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-05 14:51:14,035 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:51:14,036 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] [2021-11-05 14:51:14,036 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:51:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:51:14,039 INFO L85 PathProgramCache]: Analyzing trace with hash -864679343, now seen corresponding path program 1 times [2021-11-05 14:51:14,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:51:14,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680247365] [2021-11-05 14:51:14,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:51:14,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:51:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:51:14,304 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-05 14:51:14,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:51:14,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680247365] [2021-11-05 14:51:14,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680247365] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:51:14,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:51:14,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-05 14:51:14,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372198976] [2021-11-05 14:51:14,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:51:14,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 14:51:14,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:51:14,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 14:51:14,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:51:14,352 INFO L87 Difference]: Start difference. First operand has 1042 states, 1040 states have (on average 1.4942307692307693) internal successors, (1554), 1041 states have internal predecessors, (1554), 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 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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-05 14:51:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:51:14,581 INFO L93 Difference]: Finished difference Result 2079 states and 3101 transitions. [2021-11-05 14:51:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:51:14,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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 36 [2021-11-05 14:51:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:51:14,598 INFO L225 Difference]: With dead ends: 2079 [2021-11-05 14:51:14,598 INFO L226 Difference]: Without dead ends: 1011 [2021-11-05 14:51:14,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.55ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:51:14,609 INFO L933 BasicCegarLoop]: 1528 mSDtfsCounter, 1534 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.99ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71.61ms IncrementalHoareTripleChecker+Time [2021-11-05 14:51:14,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1534 Valid, 1528 Invalid, 12 Unknown, 0 Unchecked, 12.99ms Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 71.61ms Time] [2021-11-05 14:51:14,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-11-05 14:51:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2021-11-05 14:51:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.4772277227722772) internal successors, (1492), 1010 states have internal predecessors, (1492), 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-05 14:51:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1492 transitions. [2021-11-05 14:51:14,678 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1492 transitions. Word has length 36 [2021-11-05 14:51:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:51:14,679 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1492 transitions. [2021-11-05 14:51:14,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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-05 14:51:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1492 transitions. [2021-11-05 14:51:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-05 14:51:14,684 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:51:14,684 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] [2021-11-05 14:51:14,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-05 14:51:14,684 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:51:14,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:51:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash -842047089, now seen corresponding path program 1 times [2021-11-05 14:51:14,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:51:14,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136750849] [2021-11-05 14:51:14,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:51:14,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:51:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:51:14,833 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-05 14:51:14,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:51:14,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136750849] [2021-11-05 14:51:14,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136750849] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:51:14,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:51:14,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 14:51:14,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802339964] [2021-11-05 14:51:14,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:51:14,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 14:51:14,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:51:14,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 14:51:14,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:51:14,836 INFO L87 Difference]: Start difference. First operand 1011 states and 1492 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-05 14:51:14,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:51:14,873 INFO L93 Difference]: Finished difference Result 1999 states and 2957 transitions. [2021-11-05 14:51:14,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 14:51:14,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2021-11-05 14:51:14,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:51:14,876 INFO L225 Difference]: With dead ends: 1999 [2021-11-05 14:51:14,877 INFO L226 Difference]: Without dead ends: 1011 [2021-11-05 14:51:14,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.04ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:51:14,878 INFO L933 BasicCegarLoop]: 1491 mSDtfsCounter, 1 mSDsluCounter, 2977 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.72ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.83ms IncrementalHoareTripleChecker+Time [2021-11-05 14:51:14,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 4468 Invalid, 7 Unknown, 0 Unchecked, 4.72ms Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 5.83ms Time] [2021-11-05 14:51:14,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-11-05 14:51:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2021-11-05 14:51:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.4762376237623762) internal successors, (1491), 1010 states have internal predecessors, (1491), 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-05 14:51:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1491 transitions. [2021-11-05 14:51:14,896 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1491 transitions. Word has length 36 [2021-11-05 14:51:14,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:51:14,896 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1491 transitions. [2021-11-05 14:51:14,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-05 14:51:14,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1491 transitions. [2021-11-05 14:51:14,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-05 14:51:14,897 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:51:14,898 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] [2021-11-05 14:51:14,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-05 14:51:14,898 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:51:14,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:51:14,898 INFO L85 PathProgramCache]: Analyzing trace with hash 44746728, now seen corresponding path program 1 times [2021-11-05 14:51:14,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:51:14,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876767017] [2021-11-05 14:51:14,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:51:14,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:51:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:51:14,997 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-05 14:51:14,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:51:14,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876767017] [2021-11-05 14:51:14,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876767017] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:51:14,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:51:14,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 14:51:14,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151114237] [2021-11-05 14:51:14,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:51:14,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 14:51:14,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:51:15,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 14:51:15,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:51:15,000 INFO L87 Difference]: Start difference. First operand 1011 states and 1491 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-05 14:51:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:51:15,095 INFO L93 Difference]: Finished difference Result 1999 states and 2956 transitions. [2021-11-05 14:51:15,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 14:51:15,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2021-11-05 14:51:15,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:51:15,101 INFO L225 Difference]: With dead ends: 1999 [2021-11-05 14:51:15,102 INFO L226 Difference]: Without dead ends: 1997 [2021-11-05 14:51:15,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.50ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:51:15,103 INFO L933 BasicCegarLoop]: 2945 mSDtfsCounter, 2664 mSDsluCounter, 3225 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 6170 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.29ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.49ms IncrementalHoareTripleChecker+Time [2021-11-05 14:51:15,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2664 Valid, 6170 Invalid, 16 Unknown, 0 Unchecked, 9.29ms Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 29.49ms Time] [2021-11-05 14:51:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2021-11-05 14:51:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1013. [2021-11-05 14:51:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1012 states have (on average 1.475296442687747) internal successors, (1493), 1012 states have internal predecessors, (1493), 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-05 14:51:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1493 transitions. [2021-11-05 14:51:15,133 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1493 transitions. Word has length 39 [2021-11-05 14:51:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:51:15,134 INFO L470 AbstractCegarLoop]: Abstraction has 1013 states and 1493 transitions. [2021-11-05 14:51:15,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-05 14:51:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1493 transitions. [2021-11-05 14:51:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-05 14:51:15,136 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:51:15,136 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, 1, 1, 1] [2021-11-05 14:51:15,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-05 14:51:15,136 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:51:15,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:51:15,137 INFO L85 PathProgramCache]: Analyzing trace with hash -660420083, now seen corresponding path program 1 times [2021-11-05 14:51:15,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:51:15,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988006849] [2021-11-05 14:51:15,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:51:15,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:51:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:51:15,216 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-05 14:51:15,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:51:15,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988006849] [2021-11-05 14:51:15,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988006849] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:51:15,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:51:15,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 14:51:15,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735876958] [2021-11-05 14:51:15,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:51:15,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 14:51:15,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:51:15,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 14:51:15,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:51:15,218 INFO L87 Difference]: Start difference. First operand 1013 states and 1493 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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-05 14:51:15,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:51:15,451 INFO L93 Difference]: Finished difference Result 2989 states and 4423 transitions. [2021-11-05 14:51:15,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 14:51:15,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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 46 [2021-11-05 14:51:15,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:51:15,457 INFO L225 Difference]: With dead ends: 2989 [2021-11-05 14:51:15,457 INFO L226 Difference]: Without dead ends: 2001 [2021-11-05 14:51:15,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.93ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:51:15,471 INFO L933 BasicCegarLoop]: 2692 mSDtfsCounter, 2914 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2914 SdHoareTripleChecker+Valid, 4171 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.95ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 123.80ms IncrementalHoareTripleChecker+Time [2021-11-05 14:51:15,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2914 Valid, 4171 Invalid, 22 Unknown, 0 Unchecked, 6.95ms Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 123.80ms Time] [2021-11-05 14:51:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2021-11-05 14:51:15,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1014. [2021-11-05 14:51:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 1.474827245804541) internal successors, (1494), 1013 states have internal predecessors, (1494), 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-05 14:51:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1494 transitions. [2021-11-05 14:51:15,524 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1494 transitions. Word has length 46 [2021-11-05 14:51:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:51:15,525 INFO L470 AbstractCegarLoop]: Abstraction has 1014 states and 1494 transitions. [2021-11-05 14:51:15,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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-05 14:51:15,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1494 transitions. [2021-11-05 14:51:15,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-05 14:51:15,526 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:51:15,526 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, 1, 1, 1, 1, 1] [2021-11-05 14:51:15,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-05 14:51:15,527 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:51:15,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:51:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash 32416044, now seen corresponding path program 1 times [2021-11-05 14:51:15,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:51:15,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264949459] [2021-11-05 14:51:15,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:51:15,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:51:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:51:15,593 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-05 14:51:15,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:51:15,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264949459] [2021-11-05 14:51:15,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264949459] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:51:15,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:51:15,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 14:51:15,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573545651] [2021-11-05 14:51:15,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:51:15,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:51:15,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:51:15,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:51:15,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:51:15,596 INFO L87 Difference]: Start difference. First operand 1014 states and 1494 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-05 14:51:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:51:15,805 INFO L93 Difference]: Finished difference Result 3636 states and 5391 transitions. [2021-11-05 14:51:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 14:51:15,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 48 [2021-11-05 14:51:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:51:15,816 INFO L225 Difference]: With dead ends: 3636 [2021-11-05 14:51:15,817 INFO L226 Difference]: Without dead ends: 3634 [2021-11-05 14:51:15,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 21.82ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-05 14:51:15,818 INFO L933 BasicCegarLoop]: 4152 mSDtfsCounter, 5250 mSDsluCounter, 8237 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5250 SdHoareTripleChecker+Valid, 12389 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.85ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.15ms IncrementalHoareTripleChecker+Time [2021-11-05 14:51:15,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5250 Valid, 12389 Invalid, 51 Unknown, 0 Unchecked, 14.85ms Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 41.15ms Time] [2021-11-05 14:51:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2021-11-05 14:51:15,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 1015. [2021-11-05 14:51:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 1.4743589743589745) internal successors, (1495), 1014 states have internal predecessors, (1495), 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-05 14:51:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1495 transitions. [2021-11-05 14:51:15,877 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1495 transitions. Word has length 48 [2021-11-05 14:51:15,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:51:15,877 INFO L470 AbstractCegarLoop]: Abstraction has 1015 states and 1495 transitions. [2021-11-05 14:51:15,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-05 14:51:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1495 transitions. [2021-11-05 14:51:15,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-05 14:51:15,879 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:51:15,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:51:15,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-05 14:51:15,879 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:51:15,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:51:15,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1646884847, now seen corresponding path program 1 times [2021-11-05 14:51:15,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:51:15,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824930080] [2021-11-05 14:51:15,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:51:15,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:51:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:51:15,950 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-05 14:51:15,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:51:15,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824930080] [2021-11-05 14:51:15,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824930080] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:51:15,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:51:15,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 14:51:15,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575289590] [2021-11-05 14:51:15,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:51:15,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 14:51:15,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:51:15,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 14:51:15,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:51:15,952 INFO L87 Difference]: Start difference. First operand 1015 states and 1495 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-05 14:51:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:51:16,073 INFO L93 Difference]: Finished difference Result 2005 states and 2962 transitions. [2021-11-05 14:51:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:51:16,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2021-11-05 14:51:16,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:51:16,078 INFO L225 Difference]: With dead ends: 2005 [2021-11-05 14:51:16,079 INFO L226 Difference]: Without dead ends: 1015 [2021-11-05 14:51:16,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.08ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:51:16,082 INFO L933 BasicCegarLoop]: 1475 mSDtfsCounter, 1437 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.50ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.28ms IncrementalHoareTripleChecker+Time [2021-11-05 14:51:16,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1437 Valid, 1494 Invalid, 17 Unknown, 0 Unchecked, 2.50ms Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 64.28ms Time] [2021-11-05 14:51:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-11-05 14:51:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1015. [2021-11-05 14:51:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 1.4733727810650887) internal successors, (1494), 1014 states have internal predecessors, (1494), 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-05 14:51:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1494 transitions. [2021-11-05 14:51:16,124 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1494 transitions. Word has length 62 [2021-11-05 14:51:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:51:16,125 INFO L470 AbstractCegarLoop]: Abstraction has 1015 states and 1494 transitions. [2021-11-05 14:51:16,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-05 14:51:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1494 transitions. [2021-11-05 14:51:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-05 14:51:16,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:51:16,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:51:16,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-05 14:51:16,127 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:51:16,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:51:16,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1521423125, now seen corresponding path program 1 times [2021-11-05 14:51:16,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:51:16,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14443201] [2021-11-05 14:51:16,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:51:16,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:51:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:51:16,191 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-05 14:51:16,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:51:16,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14443201] [2021-11-05 14:51:16,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14443201] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:51:16,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:51:16,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 14:51:16,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254573046] [2021-11-05 14:51:16,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:51:16,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 14:51:16,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:51:16,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 14:51:16,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:51:16,193 INFO L87 Difference]: Start difference. First operand 1015 states and 1494 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:51:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:51:16,352 INFO L93 Difference]: Finished difference Result 2994 states and 4425 transitions. [2021-11-05 14:51:16,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 14:51:16,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-05 14:51:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:51:16,358 INFO L225 Difference]: With dead ends: 2994 [2021-11-05 14:51:16,358 INFO L226 Difference]: Without dead ends: 2004 [2021-11-05 14:51:16,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.57ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:51:16,360 INFO L933 BasicCegarLoop]: 2905 mSDtfsCounter, 2930 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2930 SdHoareTripleChecker+Valid, 4379 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.69ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.68ms IncrementalHoareTripleChecker+Time [2021-11-05 14:51:16,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2930 Valid, 4379 Invalid, 33 Unknown, 0 Unchecked, 6.69ms Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 66.68ms Time] [2021-11-05 14:51:16,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2021-11-05 14:51:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1019. [2021-11-05 14:51:16,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 1.4724950884086443) internal successors, (1499), 1018 states have internal predecessors, (1499), 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-05 14:51:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1499 transitions. [2021-11-05 14:51:16,404 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1499 transitions. Word has length 64 [2021-11-05 14:51:16,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:51:16,404 INFO L470 AbstractCegarLoop]: Abstraction has 1019 states and 1499 transitions. [2021-11-05 14:51:16,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:51:16,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1499 transitions. [2021-11-05 14:51:16,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-05 14:51:16,406 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:51:16,406 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, 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-05 14:51:16,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-05 14:51:16,406 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:51:16,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:51:16,407 INFO L85 PathProgramCache]: Analyzing trace with hash -897723055, now seen corresponding path program 1 times [2021-11-05 14:51:16,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:51:16,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903999054] [2021-11-05 14:51:16,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:51:16,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:51:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:51:16,464 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-05 14:51:16,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:51:16,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903999054] [2021-11-05 14:51:16,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903999054] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:51:16,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:51:16,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 14:51:16,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120415561] [2021-11-05 14:51:16,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:51:16,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 14:51:16,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:51:16,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 14:51:16,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:51:16,466 INFO L87 Difference]: Start difference. First operand 1019 states and 1499 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:51:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:51:16,581 INFO L93 Difference]: Finished difference Result 2022 states and 2979 transitions. [2021-11-05 14:51:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:51:16,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-05 14:51:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:51:16,584 INFO L225 Difference]: With dead ends: 2022 [2021-11-05 14:51:16,584 INFO L226 Difference]: Without dead ends: 1028 [2021-11-05 14:51:16,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.27ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:51:16,585 INFO L933 BasicCegarLoop]: 1444 mSDtfsCounter, 0 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.06ms SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.86ms IncrementalHoareTripleChecker+Time [2021-11-05 14:51:16,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2826 Invalid, 141 Unknown, 0 Unchecked, 3.06ms Time], IncrementalHoareTripleChecker [61 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 67.86ms Time] [2021-11-05 14:51:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-11-05 14:51:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1019. [2021-11-05 14:51:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 1.4459724950884087) internal successors, (1472), 1018 states have internal predecessors, (1472), 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-05 14:51:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1472 transitions. [2021-11-05 14:51:16,624 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1472 transitions. Word has length 67 [2021-11-05 14:51:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:51:16,624 INFO L470 AbstractCegarLoop]: Abstraction has 1019 states and 1472 transitions. [2021-11-05 14:51:16,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:51:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1472 transitions. [2021-11-05 14:51:16,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-05 14:51:16,626 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:51:16,626 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, 1, 1, 1, 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-05 14:51:16,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-05 14:51:16,626 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:51:16,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:51:16,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1614523249, now seen corresponding path program 1 times [2021-11-05 14:51:16,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:51:16,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746455823] [2021-11-05 14:51:16,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:51:16,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:51:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:51:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 14:51:16,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:51:16,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746455823] [2021-11-05 14:51:16,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746455823] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 14:51:16,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107768693] [2021-11-05 14:51:16,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:51:16,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 14:51:16,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 14:51:16,716 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-05 14:51:16,791 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-05 14:51:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:51:17,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-05 14:51:17,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:51:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 14:51:17,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:51:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 14:51:17,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107768693] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 14:51:17,366 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 14:51:17,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2021-11-05 14:51:17,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262461329] [2021-11-05 14:51:17,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 14:51:17,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-05 14:51:17,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:51:17,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-05 14:51:17,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-11-05 14:51:17,367 INFO L87 Difference]: Start difference. First operand 1019 states and 1472 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 9 states have internal predecessors, (125), 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-05 14:51:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:51:17,912 INFO L93 Difference]: Finished difference Result 5944 states and 8634 transitions. [2021-11-05 14:51:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:51:17,912 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 9 states have internal predecessors, (125), 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 70 [2021-11-05 14:51:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:51:17,926 INFO L225 Difference]: With dead ends: 5944 [2021-11-05 14:51:17,926 INFO L226 Difference]: Without dead ends: 4950 [2021-11-05 14:51:17,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 36.17ms TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2021-11-05 14:51:17,930 INFO L933 BasicCegarLoop]: 2656 mSDtfsCounter, 13798 mSDsluCounter, 8538 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 142.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13798 SdHoareTripleChecker+Valid, 11194 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.02ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 179.19ms IncrementalHoareTripleChecker+Time [2021-11-05 14:51:17,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13798 Valid, 11194 Invalid, 88 Unknown, 0 Unchecked, 23.02ms Time], IncrementalHoareTripleChecker [18 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 179.19ms Time] [2021-11-05 14:51:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4950 states. [2021-11-05 14:51:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4950 to 1026. [2021-11-05 14:51:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1025 states have (on average 1.4448780487804878) internal successors, (1481), 1025 states have internal predecessors, (1481), 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-05 14:51:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1481 transitions. [2021-11-05 14:51:18,014 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1481 transitions. Word has length 70 [2021-11-05 14:51:18,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:51:18,014 INFO L470 AbstractCegarLoop]: Abstraction has 1026 states and 1481 transitions. [2021-11-05 14:51:18,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 9 states have internal predecessors, (125), 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-05 14:51:18,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1481 transitions. [2021-11-05 14:51:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-05 14:51:18,016 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:51:18,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:51:18,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-05 14:51:18,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 14:51:18,251 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:51:18,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:51:18,252 INFO L85 PathProgramCache]: Analyzing trace with hash 469377729, now seen corresponding path program 1 times [2021-11-05 14:51:18,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:51:18,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334808538] [2021-11-05 14:51:18,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:51:18,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:51:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:51:18,437 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-05 14:51:18,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:51:18,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334808538] [2021-11-05 14:51:18,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334808538] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:51:18,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:51:18,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-05 14:51:18,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404988604] [2021-11-05 14:51:18,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:51:18,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 14:51:18,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:51:18,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 14:51:18,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-05 14:51:18,439 INFO L87 Difference]: Start difference. First operand 1026 states and 1481 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:51:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:51:18,968 INFO L93 Difference]: Finished difference Result 4813 states and 6993 transitions. [2021-11-05 14:51:18,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-05 14:51:18,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-05 14:51:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:51:18,979 INFO L225 Difference]: With dead ends: 4813 [2021-11-05 14:51:18,979 INFO L226 Difference]: Without dead ends: 3802 [2021-11-05 14:51:18,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 86.80ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-05 14:51:18,981 INFO L933 BasicCegarLoop]: 2730 mSDtfsCounter, 7884 mSDsluCounter, 13286 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 139.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7884 SdHoareTripleChecker+Valid, 16016 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.18ms SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 179.52ms IncrementalHoareTripleChecker+Time [2021-11-05 14:51:18,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7884 Valid, 16016 Invalid, 257 Unknown, 0 Unchecked, 24.18ms Time], IncrementalHoareTripleChecker [29 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 179.52ms Time] [2021-11-05 14:51:18,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2021-11-05 14:51:19,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 1026. [2021-11-05 14:51:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1025 states have (on average 1.4439024390243902) internal successors, (1480), 1025 states have internal predecessors, (1480), 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-05 14:51:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1480 transitions. [2021-11-05 14:51:19,045 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1480 transitions. Word has length 75 [2021-11-05 14:51:19,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:51:19,046 INFO L470 AbstractCegarLoop]: Abstraction has 1026 states and 1480 transitions. [2021-11-05 14:51:19,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:51:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1480 transitions. [2021-11-05 14:51:19,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-05 14:51:19,047 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:51:19,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:51:19,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-05 14:51:19,048 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:51:19,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:51:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash 554117517, now seen corresponding path program 1 times [2021-11-05 14:51:19,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:51:19,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870764491] [2021-11-05 14:51:19,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:51:19,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:51:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:51:19,121 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-05 14:51:19,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:51:19,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870764491] [2021-11-05 14:51:19,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870764491] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:51:19,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:51:19,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 14:51:19,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532354376] [2021-11-05 14:51:19,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:51:19,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 14:51:19,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:51:19,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 14:51:19,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:51:19,123 INFO L87 Difference]: Start difference. First operand 1026 states and 1480 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:51:19,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:51:19,315 INFO L93 Difference]: Finished difference Result 3665 states and 5327 transitions. [2021-11-05 14:51:19,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 14:51:19,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-11-05 14:51:19,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:51:19,323 INFO L225 Difference]: With dead ends: 3665 [2021-11-05 14:51:19,323 INFO L226 Difference]: Without dead ends: 2664 [2021-11-05 14:51:19,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.82ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:51:19,325 INFO L933 BasicCegarLoop]: 2668 mSDtfsCounter, 3573 mSDsluCounter, 4106 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3573 SdHoareTripleChecker+Valid, 6774 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.47ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.83ms IncrementalHoareTripleChecker+Time [2021-11-05 14:51:19,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3573 Valid, 6774 Invalid, 28 Unknown, 0 Unchecked, 7.47ms Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 29.83ms Time] [2021-11-05 14:51:19,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2021-11-05 14:51:19,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 1028. [2021-11-05 14:51:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1027 states have (on average 1.4430379746835442) internal successors, (1482), 1027 states have internal predecessors, (1482), 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-05 14:51:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1482 transitions. [2021-11-05 14:51:19,384 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1482 transitions. Word has length 78 [2021-11-05 14:51:19,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:51:19,384 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 1482 transitions. [2021-11-05 14:51:19,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:51:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1482 transitions. [2021-11-05 14:51:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-05 14:51:19,400 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:51:19,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:51:19,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-05 14:51:19,401 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:51:19,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:51:19,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1246418957, now seen corresponding path program 1 times [2021-11-05 14:51:19,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:51:19,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614564919] [2021-11-05 14:51:19,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:51:19,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:51:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:51:19,442 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-05 14:51:19,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:51:19,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614564919] [2021-11-05 14:51:19,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614564919] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:51:19,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:51:19,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 14:51:19,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114517616] [2021-11-05 14:51:19,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:51:19,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 14:51:19,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:51:19,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 14:51:19,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:51:19,444 INFO L87 Difference]: Start difference. First operand 1028 states and 1482 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-05 14:51:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:51:19,574 INFO L93 Difference]: Finished difference Result 2862 states and 4152 transitions. [2021-11-05 14:51:19,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:51:19,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-05 14:51:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:51:19,579 INFO L225 Difference]: With dead ends: 2862 [2021-11-05 14:51:19,579 INFO L226 Difference]: Without dead ends: 1859 [2021-11-05 14:51:19,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.93ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:51:19,580 INFO L933 BasicCegarLoop]: 2668 mSDtfsCounter, 1218 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 4107 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.06ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.50ms IncrementalHoareTripleChecker+Time [2021-11-05 14:51:19,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1218 Valid, 4107 Invalid, 18 Unknown, 0 Unchecked, 3.06ms Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 22.50ms Time] [2021-11-05 14:51:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2021-11-05 14:51:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1030. [2021-11-05 14:51:19,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.4421768707482994) internal successors, (1484), 1029 states have internal predecessors, (1484), 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-05 14:51:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1484 transitions. [2021-11-05 14:51:19,643 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1484 transitions. Word has length 80 [2021-11-05 14:51:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:51:19,643 INFO L470 AbstractCegarLoop]: Abstraction has 1030 states and 1484 transitions. [2021-11-05 14:51:19,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-05 14:51:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1484 transitions. [2021-11-05 14:51:19,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-05 14:51:19,645 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:51:19,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:51:19,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-05 14:51:19,646 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:51:19,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:51:19,646 INFO L85 PathProgramCache]: Analyzing trace with hash -641251963, now seen corresponding path program 1 times [2021-11-05 14:51:19,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:51:19,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597981753] [2021-11-05 14:51:19,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:51:19,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:51:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:51:19,726 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-05 14:51:19,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:51:19,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597981753] [2021-11-05 14:51:19,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597981753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:51:19,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:51:19,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 14:51:19,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291269680] [2021-11-05 14:51:19,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:51:19,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:51:19,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:51:19,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:51:19,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:51:19,728 INFO L87 Difference]: Start difference. First operand 1030 states and 1484 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-05 14:51:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:51:20,280 INFO L93 Difference]: Finished difference Result 6613 states and 9612 transitions. [2021-11-05 14:51:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 14:51:20,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2021-11-05 14:51:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:51:20,290 INFO L225 Difference]: With dead ends: 6613 [2021-11-05 14:51:20,291 INFO L226 Difference]: Without dead ends: 5608 [2021-11-05 14:51:20,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 30.17ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-05 14:51:20,293 INFO L933 BasicCegarLoop]: 3994 mSDtfsCounter, 8994 mSDsluCounter, 9350 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 114.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8994 SdHoareTripleChecker+Valid, 13344 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.52ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 138.27ms IncrementalHoareTripleChecker+Time [2021-11-05 14:51:20,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8994 Valid, 13344 Invalid, 190 Unknown, 0 Unchecked, 12.52ms Time], IncrementalHoareTripleChecker [12 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 138.27ms Time] [2021-11-05 14:51:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5608 states. [2021-11-05 14:51:20,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5608 to 1033. [2021-11-05 14:51:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1032 states have (on average 1.440891472868217) internal successors, (1487), 1032 states have internal predecessors, (1487), 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-05 14:51:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1487 transitions. [2021-11-05 14:51:20,391 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1487 transitions. Word has length 84 [2021-11-05 14:51:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:51:20,391 INFO L470 AbstractCegarLoop]: Abstraction has 1033 states and 1487 transitions. [2021-11-05 14:51:20,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-05 14:51:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1487 transitions. [2021-11-05 14:51:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-05 14:51:20,393 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:51:20,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:51:20,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-05 14:51:20,394 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:51:20,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:51:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash -522722400, now seen corresponding path program 1 times [2021-11-05 14:51:20,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:51:20,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901784973] [2021-11-05 14:51:20,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:51:20,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:51:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:51:21,711 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-05 14:51:21,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:51:21,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901784973] [2021-11-05 14:51:21,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901784973] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:51:21,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:51:21,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-11-05 14:51:21,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239832497] [2021-11-05 14:51:21,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:51:21,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-05 14:51:21,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:51:21,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-05 14:51:21,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2021-11-05 14:51:21,712 INFO L87 Difference]: Start difference. First operand 1033 states and 1487 transitions. Second operand has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 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-05 14:51:25,065 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-05 14:51:28,445 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-05 14:51:31,804 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:51:40,598 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:51:47,376 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-05 14:51:54,396 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-05 14:51:58,103 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-05 14:52:00,125 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-05 14:52:01,544 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:52:03,842 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:52:06,039 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-05 14:52:11,647 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-05 14:52:19,743 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-05 14:52:21,768 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-05 14:52:23,079 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:52:25,098 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-05 14:52:27,127 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-05 14:52:29,149 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-05 14:52:31,172 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-05 14:52:32,674 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:52:33,682 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-05 14:52:36,208 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-05 14:52:37,932 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:52:39,957 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-05 14:52:42,198 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-05 14:52:46,774 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:52:53,187 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-05 14:52:55,637 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-05 14:52:57,663 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-05 14:52:58,765 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:53:02,437 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-05 14:53:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:53:04,258 INFO L93 Difference]: Finished difference Result 23275 states and 34628 transitions. [2021-11-05 14:53:04,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2021-11-05 14:53:04,258 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 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 87 [2021-11-05 14:53:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:53:04,350 INFO L225 Difference]: With dead ends: 23275 [2021-11-05 14:53:04,351 INFO L226 Difference]: Without dead ends: 23273 [2021-11-05 14:53:04,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9452 ImplicationChecksByTransitivity, 8501.72ms TimeCoverageRelationStatistics Valid=3581, Invalid=23809, Unknown=0, NotChecked=0, Total=27390 [2021-11-05 14:53:04,363 INFO L933 BasicCegarLoop]: 8333 mSDtfsCounter, 58943 mSDsluCounter, 142092 mSDsCounter, 0 mSdLazyCounter, 19702 mSolverCounterSat, 606 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 86284.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 58943 SdHoareTripleChecker+Valid, 150425 SdHoareTripleChecker+Invalid, 20329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 205.34ms SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 19702 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 89929.34ms IncrementalHoareTripleChecker+Time [2021-11-05 14:53:04,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58943 Valid, 150425 Invalid, 20329 Unknown, 0 Unchecked, 205.34ms Time], IncrementalHoareTripleChecker [606 Valid, 19702 Invalid, 21 Unknown, 0 Unchecked, 89929.34ms Time] [2021-11-05 14:53:04,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23273 states. [2021-11-05 14:53:04,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23273 to 1702. [2021-11-05 14:53:04,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1701 states have (on average 1.442092886537331) internal successors, (2453), 1701 states have internal predecessors, (2453), 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-05 14:53:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2453 transitions. [2021-11-05 14:53:04,665 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2453 transitions. Word has length 87 [2021-11-05 14:53:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:53:04,667 INFO L470 AbstractCegarLoop]: Abstraction has 1702 states and 2453 transitions. [2021-11-05 14:53:04,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 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-05 14:53:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2453 transitions. [2021-11-05 14:53:04,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-05 14:53:04,670 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:53:04,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:53:04,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-05 14:53:04,671 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:53:04,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:53:04,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1109733853, now seen corresponding path program 1 times [2021-11-05 14:53:04,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:53:04,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053051759] [2021-11-05 14:53:04,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:53:04,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:53:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:53:05,977 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-05 14:53:05,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:53:05,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053051759] [2021-11-05 14:53:05,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053051759] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:53:05,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:53:05,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-11-05 14:53:05,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886918976] [2021-11-05 14:53:05,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:53:05,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-05 14:53:05,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:53:05,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-05 14:53:05,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2021-11-05 14:53:05,979 INFO L87 Difference]: Start difference. First operand 1702 states and 2453 transitions. Second operand has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 28 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-05 14:53:14,576 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-05 14:53:25,726 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:53:31,425 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-05 14:53:33,451 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-05 14:53:35,479 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-05 14:53:37,508 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-05 14:53:39,348 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:53:41,374 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-05 14:53:43,397 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-05 14:53:45,421 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-05 14:53:46,512 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:53:48,528 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-05 14:53:56,658 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-05 14:53:58,685 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-05 14:54:00,713 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-05 14:54:03,669 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-05 14:54:05,702 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-05 14:54:07,730 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-05 14:54:10,656 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-05 14:54:19,376 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-05 14:54:21,726 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-05 14:54:26,563 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-05 14:54:28,813 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-05 14:54:30,841 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-05 14:54:32,865 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-05 14:54:34,890 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-05 14:54:36,924 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-05 14:54:38,948 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-05 14:54:40,970 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-05 14:54:42,519 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:54:44,539 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-05 14:54:48,412 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-05 14:54:50,440 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-05 14:54:52,466 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-05 14:54:54,494 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-05 14:54:58,609 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:54:59,994 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:55:05,333 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-05 14:55:07,296 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:55:08,879 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-05 14:55:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:55:12,465 INFO L93 Difference]: Finished difference Result 23282 states and 34637 transitions. [2021-11-05 14:55:12,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2021-11-05 14:55:12,465 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 28 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 87 [2021-11-05 14:55:12,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:55:12,497 INFO L225 Difference]: With dead ends: 23282 [2021-11-05 14:55:12,498 INFO L226 Difference]: Without dead ends: 23280 [2021-11-05 14:55:12,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9464 ImplicationChecksByTransitivity, 8627.29ms TimeCoverageRelationStatistics Valid=3626, Invalid=24096, Unknown=0, NotChecked=0, Total=27722 [2021-11-05 14:55:12,507 INFO L933 BasicCegarLoop]: 8333 mSDtfsCounter, 57685 mSDsluCounter, 148558 mSDsCounter, 0 mSdLazyCounter, 19499 mSolverCounterSat, 621 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 108316.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 57685 SdHoareTripleChecker+Valid, 156891 SdHoareTripleChecker+Invalid, 20151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 208.19ms SdHoareTripleChecker+Time, 621 IncrementalHoareTripleChecker+Valid, 19499 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 112175.25ms IncrementalHoareTripleChecker+Time [2021-11-05 14:55:12,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57685 Valid, 156891 Invalid, 20151 Unknown, 0 Unchecked, 208.19ms Time], IncrementalHoareTripleChecker [621 Valid, 19499 Invalid, 31 Unknown, 0 Unchecked, 112175.25ms Time] [2021-11-05 14:55:12,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23280 states. [2021-11-05 14:55:12,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23280 to 1702. [2021-11-05 14:55:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1701 states have (on average 1.442092886537331) internal successors, (2453), 1701 states have internal predecessors, (2453), 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-05 14:55:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2453 transitions. [2021-11-05 14:55:12,892 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2453 transitions. Word has length 87 [2021-11-05 14:55:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:55:12,892 INFO L470 AbstractCegarLoop]: Abstraction has 1702 states and 2453 transitions. [2021-11-05 14:55:12,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 28 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-05 14:55:12,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2453 transitions. [2021-11-05 14:55:12,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-05 14:55:12,895 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:55:12,895 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:55:12,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-05 14:55:12,895 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:55:12,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:55:12,896 INFO L85 PathProgramCache]: Analyzing trace with hash 216216861, now seen corresponding path program 1 times [2021-11-05 14:55:12,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:55:12,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035541229] [2021-11-05 14:55:12,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:55:12,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:55:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:55:13,008 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-05 14:55:13,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:55:13,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035541229] [2021-11-05 14:55:13,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035541229] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:55:13,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:55:13,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 14:55:13,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129592903] [2021-11-05 14:55:13,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:55:13,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 14:55:13,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:55:13,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 14:55:13,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 14:55:13,010 INFO L87 Difference]: Start difference. First operand 1702 states and 2453 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-05 14:55:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:55:13,306 INFO L93 Difference]: Finished difference Result 2710 states and 3913 transitions. [2021-11-05 14:55:13,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 14:55:13,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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 87 [2021-11-05 14:55:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:55:13,309 INFO L225 Difference]: With dead ends: 2710 [2021-11-05 14:55:13,309 INFO L226 Difference]: Without dead ends: 1699 [2021-11-05 14:55:13,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.61ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 14:55:13,311 INFO L933 BasicCegarLoop]: 1462 mSDtfsCounter, 3 mSDsluCounter, 4375 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5837 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.11ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.43ms IncrementalHoareTripleChecker+Time [2021-11-05 14:55:13,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 5837 Invalid, 13 Unknown, 0 Unchecked, 2.11ms Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 8.43ms Time] [2021-11-05 14:55:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2021-11-05 14:55:13,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1699. [2021-11-05 14:55:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1698 states have (on average 1.4422850412249706) internal successors, (2449), 1698 states have internal predecessors, (2449), 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-05 14:55:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2449 transitions. [2021-11-05 14:55:13,628 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2449 transitions. Word has length 87 [2021-11-05 14:55:13,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:55:13,628 INFO L470 AbstractCegarLoop]: Abstraction has 1699 states and 2449 transitions. [2021-11-05 14:55:13,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-05 14:55:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2449 transitions. [2021-11-05 14:55:13,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-05 14:55:13,631 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:55:13,631 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:55:13,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-05 14:55:13,632 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:55:13,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:55:13,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2062058996, now seen corresponding path program 1 times [2021-11-05 14:55:13,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:55:13,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868972102] [2021-11-05 14:55:13,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:55:13,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:55:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:55:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 14:55:14,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:55:14,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868972102] [2021-11-05 14:55:14,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868972102] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 14:55:14,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:55:14,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-05 14:55:14,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574278873] [2021-11-05 14:55:14,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 14:55:14,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-05 14:55:14,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:55:14,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-05 14:55:14,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-05 14:55:14,003 INFO L87 Difference]: Start difference. First operand 1699 states and 2449 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 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-05 14:55:15,977 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:55:19,163 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-05 14:55:22,438 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:55:26,518 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-05 14:55:28,330 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:55:37,406 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:55:41,476 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-05 14:55:43,646 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-05 14:55:45,098 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:55:46,493 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:55:47,995 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:55:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:55:49,775 INFO L93 Difference]: Finished difference Result 21133 states and 31290 transitions. [2021-11-05 14:55:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-11-05 14:55:49,776 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 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 90 [2021-11-05 14:55:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:55:49,803 INFO L225 Difference]: With dead ends: 21133 [2021-11-05 14:55:49,803 INFO L226 Difference]: Without dead ends: 19459 [2021-11-05 14:55:49,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4953 ImplicationChecksByTransitivity, 1751.40ms TimeCoverageRelationStatistics Valid=2558, Invalid=10782, Unknown=0, NotChecked=0, Total=13340 [2021-11-05 14:55:49,811 INFO L933 BasicCegarLoop]: 4978 mSDtfsCounter, 35055 mSDsluCounter, 24534 mSDsCounter, 0 mSdLazyCounter, 3887 mSolverCounterSat, 402 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28562.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 35055 SdHoareTripleChecker+Valid, 29512 SdHoareTripleChecker+Invalid, 4293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 55.09ms SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 3887 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29631.26ms IncrementalHoareTripleChecker+Time [2021-11-05 14:55:49,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35055 Valid, 29512 Invalid, 4293 Unknown, 0 Unchecked, 55.09ms Time], IncrementalHoareTripleChecker [402 Valid, 3887 Invalid, 4 Unknown, 0 Unchecked, 29631.26ms Time] [2021-11-05 14:55:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19459 states. [2021-11-05 14:55:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19459 to 2553. [2021-11-05 14:55:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2552 states have (on average 1.4627742946708464) internal successors, (3733), 2552 states have internal predecessors, (3733), 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-05 14:55:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3733 transitions. [2021-11-05 14:55:50,371 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3733 transitions. Word has length 90 [2021-11-05 14:55:50,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:55:50,371 INFO L470 AbstractCegarLoop]: Abstraction has 2553 states and 3733 transitions. [2021-11-05 14:55:50,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 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-05 14:55:50,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3733 transitions. [2021-11-05 14:55:50,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-05 14:55:50,375 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:55:50,375 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:55:50,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-05 14:55:50,375 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:55:50,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:55:50,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1009416979, now seen corresponding path program 1 times [2021-11-05 14:55:50,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:55:50,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510873568] [2021-11-05 14:55:50,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:55:50,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:55:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:55:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-05 14:55:50,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 14:55:50,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510873568] [2021-11-05 14:55:50,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510873568] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 14:55:50,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111099432] [2021-11-05 14:55:50,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:55:50,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 14:55:50,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 14:55:50,443 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-05 14:55:50,447 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-05 14:55:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:55:50,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-05 14:55:50,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:55:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-05 14:55:50,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:55:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-05 14:55:51,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111099432] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 14:55:51,131 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 14:55:51,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2021-11-05 14:55:51,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578710460] [2021-11-05 14:55:51,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 14:55:51,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-05 14:55:51,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 14:55:51,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-05 14:55:51,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-11-05 14:55:51,133 INFO L87 Difference]: Start difference. First operand 2553 states and 3733 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 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-05 14:55:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:55:53,122 INFO L93 Difference]: Finished difference Result 11688 states and 17013 transitions. [2021-11-05 14:55:53,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 14:55:53,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 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 95 [2021-11-05 14:55:53,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:55:53,134 INFO L225 Difference]: With dead ends: 11688 [2021-11-05 14:55:53,135 INFO L226 Difference]: Without dead ends: 9160 [2021-11-05 14:55:53,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 37.91ms TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2021-11-05 14:55:53,138 INFO L933 BasicCegarLoop]: 2640 mSDtfsCounter, 18052 mSDsluCounter, 6926 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 131.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 18052 SdHoareTripleChecker+Valid, 9566 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.41ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 150.95ms IncrementalHoareTripleChecker+Time [2021-11-05 14:55:53,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18052 Valid, 9566 Invalid, 58 Unknown, 0 Unchecked, 14.41ms Time], IncrementalHoareTripleChecker [14 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 150.95ms Time] [2021-11-05 14:55:53,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9160 states. [2021-11-05 14:55:53,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9160 to 2603. [2021-11-05 14:55:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2603 states, 2602 states have (on average 1.462336664104535) internal successors, (3805), 2602 states have internal predecessors, (3805), 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-05 14:55:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 3805 transitions. [2021-11-05 14:55:53,752 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 3805 transitions. Word has length 95 [2021-11-05 14:55:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:55:53,752 INFO L470 AbstractCegarLoop]: Abstraction has 2603 states and 3805 transitions. [2021-11-05 14:55:53,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 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-05 14:55:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 3805 transitions. [2021-11-05 14:55:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-05 14:55:53,755 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:55:53,755 INFO L514 BasicCegarLoop]: trace histogram [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-05 14:55:53,775 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-05 14:55:53,965 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,SelfDestructingSolverStorable17 [2021-11-05 14:55:53,966 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:55:53,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:55:53,967 INFO L85 PathProgramCache]: Analyzing trace with hash -855956460, now seen corresponding path program 1 times [2021-11-05 14:55:53,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 14:55:53,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623104424] [2021-11-05 14:55:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:55:53,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 14:55:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-05 14:55:54,208 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-05 14:55:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-05 14:55:54,453 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-05 14:55:54,453 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-05 14:55:54,454 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-05 14:55:54,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-05 14:55:54,457 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:55:54,459 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-05 14:55:54,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 02:55:54 BoogieIcfgContainer [2021-11-05 14:55:54,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-05 14:55:54,662 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-05 14:55:54,662 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-05 14:55:54,662 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-05 14:55:54,662 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 02:51:13" (3/4) ... [2021-11-05 14:55:54,664 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-05 14:55:54,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-05 14:55:54,664 INFO L158 Benchmark]: Toolchain (without parser) took 285083.04ms. Allocated memory was 56.6MB in the beginning and 1.2GB in the end (delta: 1.2GB). Free memory was 26.9MB in the beginning and 894.9MB in the end (delta: -868.0MB). Peak memory consumption was 318.2MB. Max. memory is 16.1GB. [2021-11-05 14:55:54,664 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 39.0MB in the beginning and 39.0MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-05 14:55:54,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1250.18ms. Allocated memory was 56.6MB in the beginning and 90.2MB in the end (delta: 33.6MB). Free memory was 26.8MB in the beginning and 36.7MB in the end (delta: -10.0MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2021-11-05 14:55:54,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 227.30ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 36.7MB in the beginning and 49.0MB in the end (delta: -12.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2021-11-05 14:55:54,665 INFO L158 Benchmark]: Boogie Preprocessor took 195.61ms. Allocated memory is still 115.3MB. Free memory was 49.0MB in the beginning and 40.5MB in the end (delta: 8.4MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2021-11-05 14:55:54,669 INFO L158 Benchmark]: RCFGBuilder took 2713.51ms. Allocated memory was 115.3MB in the beginning and 230.7MB in the end (delta: 115.3MB). Free memory was 40.5MB in the beginning and 130.5MB in the end (delta: -90.0MB). Peak memory consumption was 97.4MB. Max. memory is 16.1GB. [2021-11-05 14:55:54,670 INFO L158 Benchmark]: TraceAbstraction took 280689.69ms. Allocated memory was 230.7MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 129.5MB in the beginning and 894.9MB in the end (delta: -765.4MB). Peak memory consumption was 901.9MB. Max. memory is 16.1GB. [2021-11-05 14:55:54,670 INFO L158 Benchmark]: Witness Printer took 2.12ms. Allocated memory is still 1.2GB. Free memory is still 894.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-05 14:55:54,672 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 39.0MB in the beginning and 39.0MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1250.18ms. Allocated memory was 56.6MB in the beginning and 90.2MB in the end (delta: 33.6MB). Free memory was 26.8MB in the beginning and 36.7MB in the end (delta: -10.0MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 227.30ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 36.7MB in the beginning and 49.0MB in the end (delta: -12.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 195.61ms. Allocated memory is still 115.3MB. Free memory was 49.0MB in the beginning and 40.5MB in the end (delta: 8.4MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * RCFGBuilder took 2713.51ms. Allocated memory was 115.3MB in the beginning and 230.7MB in the end (delta: 115.3MB). Free memory was 40.5MB in the beginning and 130.5MB in the end (delta: -90.0MB). Peak memory consumption was 97.4MB. Max. memory is 16.1GB. * TraceAbstraction took 280689.69ms. Allocated memory was 230.7MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 129.5MB in the beginning and 894.9MB in the end (delta: -765.4MB). Peak memory consumption was 901.9MB. Max. memory is 16.1GB. * Witness Printer took 2.12ms. Allocated memory is still 1.2GB. Free memory is still 894.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 7129]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 4873, overapproximation of bitwiseAnd at line 4735. Possible FailurePath: [L5034] static struct net_device **slip_devs ; [L5035] static int slip_maxdev = 256; [L5850-L5853] static struct net_device_ops const sl_netdev_ops = {& sl_init, & sl_uninit, & sl_open, & sl_close, & sl_xmit, 0, 0, 0, 0, 0, 0, & sl_ioctl, 0, & sl_change_mtu, 0, & sl_tx_timeout, & sl_get_stats64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L6723-L6726] static struct tty_ldisc_ops sl_ldisc = {21507, (char *)"slip", 0, 0, & slip_open, & slip_close, 0, 0, 0, 0, & slip_ioctl, & slip_compat_ioctl, 0, 0, & slip_hangup, & slip_receive_buf, & slip_write_wakeup, 0, & __this_module, 0}; [L6910] int LDV_IN_INTERRUPT ; VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=0, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L6913] int res_sl_init_14 ; [L6914] int res_sl_open_11 ; [L6915] int res_sl_close_10 ; [L6916] struct sk_buff *var_group2 ; [L6917] struct rtnl_link_stats64 var_group3 ; [L6918] int var_sl_change_mtu_12_p1 ; [L6919] struct ifreq var_group4 ; [L6920] int var_sl_ioctl_30_p2 ; [L6921] struct tty_struct var_group5 ; [L6922] int res_slip_open_21 ; [L6923] struct file *var_group6 ; [L6924] unsigned int var_slip_ioctl_28_p2 ; [L6925] unsigned long var_slip_ioctl_28_p3 ; [L6926] unsigned int var_slip_compat_ioctl_29_p2 ; [L6927] unsigned long var_slip_compat_ioctl_29_p3 ; [L6928] unsigned char const *var_slip_receive_buf_18_p1 ; [L6929] char *var_slip_receive_buf_18_p2 ; [L6930] int var_slip_receive_buf_18_p3 ; [L6931] unsigned long var_sl_keepalive_34_p0 ; [L6932] unsigned long var_sl_outfill_33_p0 ; [L6933] int ldv_s_sl_netdev_ops_net_device_ops ; [L6934] int ldv_s_sl_ldisc_tty_ldisc_ops ; [L6935] int tmp ; [L6936] int tmp___0 ; [L6937] int tmp___1 ; [L4847] COND FALSE !(__VERIFIER_nondet_int()) [L4852] return ((void *)0); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=0, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] return ldv_malloc(sizeof(struct sk_buff)); [L6939] var_group2 = dev_alloc_skb(1U) [L6940] ldv_s_sl_netdev_ops_net_device_ops = 0 [L6941] ldv_s_sl_ldisc_tty_ldisc_ops = 0 [L6942] LDV_IN_INTERRUPT = 1 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L6729] int status ; [L6730] void *tmp ; VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L6732] COND FALSE !(slip_maxdev <= 3) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L4871] void *tmp ; [L4862] void *tmp___2 ; [L4847] COND TRUE __VERIFIER_nondet_int() [L4848] void *res = malloc(size); [L4843] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L4838] COND FALSE !(!cond) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L4850] return res; VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L4857] return ldv_malloc(size); [L4864] tmp___2 = __kmalloc(size, flags) [L4865] return (tmp___2); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L4873] tmp = kmalloc(size, flags | 32768U) [L4874] return (tmp); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L6740] tmp = kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6741] slip_devs = (struct net_device **)tmp VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6742] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L7287] return __VERIFIER_nondet_int(); [L6747] status = tty_register_ldisc(1, & sl_ldisc) [L6748] COND FALSE !(status != 0) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6753] return (status); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6945] tmp = slip_init() [L6946] COND FALSE !(tmp != 0) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7076] tmp___1 = __VERIFIER_nondet_int() [L7077] COND TRUE (tmp___1 != 0 || ldv_s_sl_netdev_ops_net_device_ops != 0) || ldv_s_sl_ldisc_tty_ldisc_ops != 0 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6952] tmp___0 = __VERIFIER_nondet_int() [L6954] case 0: [L6967] case 1: [L6980] case 2: [L6993] case 3: [L7001] case 4: [L7005] case 5: [L7009] case 6: [L7013] case 7: [L7017] case 8: [L7021] case 9: VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7022] COND TRUE ldv_s_sl_ldisc_tty_ldisc_ops == 0 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7117] ldv_func_ret_type___1 ldv_func_res ; [L7118] int tmp ; [L6037] struct slip *sl ; [L6038] int err ; [L6039] int tmp ; [L6040] dev_t tmp___0 ; [L6041] struct task_struct *tmp___1 ; [L6042] int tmp___2 ; [L7172] return __VERIFIER_nondet_int(); [L6044] tmp = capable(12) [L6045] COND FALSE !(tmp == 0) [L6049] EXPR tty->ops [L6049] EXPR (tty->ops)->write VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6049-L6051] COND FALSE !((unsigned long )(tty->ops)->write == (unsigned long )((int (* )(struct tty_struct * , unsigned char const * , int ))0)) [L5925] int i ; [L5926] struct net_device *dev ; [L5927] struct slip *sl ; [L5928] void *tmp ; [L5930] i = 0 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5951] COND TRUE i < slip_maxdev VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5933] EXPR slip_devs + (unsigned long )i [L5933] dev = *(slip_devs + (unsigned long )i) [L5934] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L4903] return ((void *)dev + 2496U); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5938] tmp = netdev_priv((struct net_device const *)dev) [L5939] sl = (struct slip *)tmp [L5940] EXPR sl->tty [L5940] (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U [L5940] EXPR sl->leased [L5940] (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5940] COND TRUE (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U [L5949] i = i + 1 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5951] COND TRUE i < slip_maxdev VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5933] EXPR slip_devs + (unsigned long )i [L5933] dev = *(slip_devs + (unsigned long )i) [L5934] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6057] EXPR tty->disc_data [L6057] sl = (struct slip *)tty->disc_data [L6058] err = -17 [L6059] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 [L6059] EXPR sl->magic [L6059] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6059] COND FALSE !((unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250) [L6063] err = -23 [L7276] return __VERIFIER_nondet_uint(); [L6064] tmp___0 = tty_devnum(tty) [L5961] int i ; [L5962] struct net_device *dev ; [L5963] struct slip *sl ; [L5964] void *tmp ; [L5965] int tmp___0 ; [L5966] char name[16U] ; [L5967] void *tmp___1 ; [L5968] struct lock_class_key __key ; [L5969] struct lock_class_key __key___0 ; [L5970] struct lock_class_key __key___1 ; [L5972] dev = 0 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5973] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L5977] i = 0 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5987] COND TRUE i < slip_maxdev VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5980] EXPR slip_devs + (unsigned long )i [L5980] dev = *(slip_devs + (unsigned long )i) [L5981] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L5985] i = i + 1 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5987] COND TRUE i < slip_maxdev VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5980] EXPR slip_devs + (unsigned long )i [L5980] dev = *(slip_devs + (unsigned long )i) [L5981] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5992] COND FALSE !(i >= slip_maxdev) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5996] COND FALSE !((unsigned long )dev != (unsigned long )((struct net_device *)0)) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6008] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) [L4847] COND TRUE __VERIFIER_nondet_int() [L4848] void *res = malloc(size); [L4843] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4838] COND FALSE !(!cond) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4850] return res; VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7168] return ldv_malloc(sizeof(struct net_device)); [L6010] dev = alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L6011] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L6015] dev->base_addr = (unsigned long )i VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4903] return ((void *)dev + 2496U); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6018] tmp___1 = netdev_priv((struct net_device const *)dev) [L6019] sl = (struct slip *)tmp___1 [L6020] sl->magic = 21250 [L6021] sl->dev = dev [L4778] return (& lock->ldv_5934.rlock); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6024] sl->mode = 8U [L6026] sl->keepalive_timer.data = (unsigned long )sl [L6027] sl->keepalive_timer.function = & sl_keepalive [L6029] sl->outfill_timer.data = (unsigned long )sl [L6030] sl->outfill_timer.function = & sl_outfill [L6031] *(slip_devs + (unsigned long )i) = dev [L6032] return (sl); [L6032] return (sl); [L6032] return (sl); [L6032] return (sl); [L6032] return (sl); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6065] sl = sl_alloc(tmp___0) [L6066] COND FALSE !((unsigned long )sl == (unsigned long )((struct slip *)0)) [L6070] sl->tty = tty [L6071] tty->disc_data = (void *)sl [L7276] return __VERIFIER_nondet_uint(); [L6072] sl->line = tty_devnum(tty) [L4746] struct task_struct *pfo_ret__ ; [L4749] case 1UL: [L4752] case 2UL: [L4755] case 4UL: [L4758] case 8UL: VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4765] return (pfo_ret__); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6073] tmp___1 = get_current() [L6074] EXPR tmp___1->pid [L6074] sl->pid = tmp___1->pid [L4735] EXPR addr + (unsigned long )(nr / 64U) [L4735] return ((int )((unsigned long )*(addr + (unsigned long )(nr / 64U)) >> ((int )nr & 63)) & 1); [L6075] tmp___2 = constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) [L6076] COND FALSE !(tmp___2 == 0) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6090] EXPR sl->keepalive VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6090] COND FALSE !((unsigned int )sl->keepalive != 0U) [L6095] EXPR sl->outfill VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6095] COND TRUE (unsigned int )sl->outfill != 0U [L6096] EXPR sl->outfill [L6096] sl->outfill_timer.expires = (unsigned long )((int )sl->outfill * 250) + (unsigned long )jiffies [L6101] tty->receive_room = 65536U [L6102] EXPR sl->dev [L6102] EXPR (sl->dev)->base_addr [L6102] return ((int )(sl->dev)->base_addr); [L7120] tmp = slip_open(tty) [L7121] ldv_func_res = tmp [L7135] COND FALSE !(ret_val <= 0) VAL [__this_module={65541:65544}, jiffies=0, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7129] reach_error() VAL [__this_module={65541:65544}, jiffies=0, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1042 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 280451.66ms, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 58.95ms, AutomataDifference: 270650.38ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 13.50ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 56 mSolverCounterUnknown, 221935 SdHoareTripleChecker+Valid, 232915.22ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221935 mSDsluCounter, 441091 SdHoareTripleChecker+Invalid, 224066.80ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 381997 mSDsCounter, 1776 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43892 IncrementalHoareTripleChecker+Invalid, 45724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1776 mSolverCounterUnsat, 59094 mSDtfsCounter, 43892 mSolverCounterSat, 616.44ms SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 877 GetRequests, 362 SyntacticMatches, 4 SemanticMatches, 511 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23946 ImplicationChecksByTransitivity, 19163.57ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2603occurred in iteration=18, InterpolantAutomatonStates: 473, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 2875.33ms AutomataMinimizationTime, 18 MinimizatonAttempts, 85936 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 176.78ms SsaConstructionTime, 1792.97ms SatisfiabilityAnalysisTime, 3400.24ms InterpolantComputationTime, 1493 NumberOfCodeBlocks, 1493 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1539 ConstructedInterpolants, 0 QuantifiedInterpolants, 6792 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1895 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 13/19 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-05 14:55:54,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 14:55:56,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 14:55:56,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 14:55:56,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 14:55:56,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 14:55:56,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 14:55:56,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 14:55:56,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 14:55:56,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 14:55:56,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 14:55:56,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 14:55:56,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 14:55:56,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 14:55:56,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 14:55:56,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 14:55:56,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 14:55:56,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 14:55:56,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 14:55:56,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 14:55:56,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 14:55:56,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 14:55:56,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 14:55:56,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 14:55:56,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 14:55:56,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 14:55:56,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 14:55:56,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 14:55:56,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 14:55:56,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 14:55:56,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 14:55:56,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 14:55:56,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 14:55:56,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 14:55:56,454 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 14:55:56,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 14:55:56,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 14:55:56,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 14:55:56,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 14:55:56,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 14:55:56,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 14:55:56,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 14:55:56,459 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-05 14:55:56,478 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 14:55:56,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 14:55:56,479 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 14:55:56,479 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 14:55:56,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 14:55:56,480 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 14:55:56,480 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 14:55:56,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 14:55:56,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 14:55:56,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 14:55:56,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 14:55:56,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 14:55:56,482 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-05 14:55:56,482 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-05 14:55:56,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 14:55:56,482 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 14:55:56,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 14:55:56,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 14:55:56,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 14:55:56,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 14:55:56,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 14:55:56,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 14:55:56,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 14:55:56,483 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 14:55:56,483 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-05 14:55:56,484 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-05 14:55:56,484 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 14:55:56,484 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 14:55:56,484 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 14:55:56,484 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 14:55:56,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-05 14:55:56,485 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb [2021-11-05 14:55:56,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 14:55:56,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 14:55:56,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 14:55:56,760 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 14:55:56,760 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 14:55:56,761 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-05 14:55:56,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f345f5792/f5efc1716c1141d092384e862c7284fb/FLAGcc14742b8 [2021-11-05 14:55:57,356 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 14:55:57,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-05 14:55:57,384 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f345f5792/f5efc1716c1141d092384e862c7284fb/FLAGcc14742b8 [2021-11-05 14:55:57,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f345f5792/f5efc1716c1141d092384e862c7284fb [2021-11-05 14:55:57,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 14:55:57,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 14:55:57,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 14:55:57,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 14:55:57,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 14:55:57,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 02:55:57" (1/1) ... [2021-11-05 14:55:57,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@331b58fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:55:57, skipping insertion in model container [2021-11-05 14:55:57,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 02:55:57" (1/1) ... [2021-11-05 14:55:57,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 14:55:57,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 14:55:58,587 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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-05 14:55:58,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 14:55:58,610 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 14:55:58,756 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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-05 14:55:58,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 14:55:58,865 INFO L208 MainTranslator]: Completed translation [2021-11-05 14:55:58,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:55:58 WrapperNode [2021-11-05 14:55:58,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 14:55:58,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 14:55:58,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 14:55:58,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 14:55:58,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:55:58" (1/1) ... [2021-11-05 14:55:58,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:55:58" (1/1) ... [2021-11-05 14:55:59,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 14:55:59,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 14:55:59,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 14:55:59,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 14:55:59,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:55:58" (1/1) ... [2021-11-05 14:55:59,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:55:58" (1/1) ... [2021-11-05 14:55:59,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:55:58" (1/1) ... [2021-11-05 14:55:59,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:55:58" (1/1) ... [2021-11-05 14:55:59,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:55:58" (1/1) ... [2021-11-05 14:55:59,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:55:58" (1/1) ... [2021-11-05 14:55:59,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:55:58" (1/1) ... [2021-11-05 14:55:59,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 14:55:59,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 14:55:59,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 14:55:59,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 14:55:59,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:55:58" (1/1) ... [2021-11-05 14:55:59,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 14:55:59,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 14:55:59,240 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-05 14:55:59,253 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-05 14:55:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-05 14:55:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-05 14:55:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-11-05 14:55:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-05 14:55:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-05 14:55:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-05 14:55:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-05 14:55:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-05 14:55:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-05 14:55:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-05 14:55:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 14:55:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 14:55:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 14:55:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-05 14:55:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-05 14:55:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-05 14:55:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-05 14:55:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 14:55:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-05 14:55:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-05 14:55:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-05 14:55:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 14:55:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-05 14:55:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 14:55:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-05 14:55:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-05 14:55:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-05 14:55:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 14:55:59,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 14:56:08,995 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 14:56:09,001 INFO L299 CfgBuilder]: Removed 972 assume(true) statements. [2021-11-05 14:56:09,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 02:56:09 BoogieIcfgContainer [2021-11-05 14:56:09,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 14:56:09,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 14:56:09,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 14:56:09,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 14:56:09,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 02:55:57" (1/3) ... [2021-11-05 14:56:09,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c8518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 02:56:09, skipping insertion in model container [2021-11-05 14:56:09,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 02:55:58" (2/3) ... [2021-11-05 14:56:09,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c8518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 02:56:09, skipping insertion in model container [2021-11-05 14:56:09,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 02:56:09" (3/3) ... [2021-11-05 14:56:09,009 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-05 14:56:09,012 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 14:56:09,012 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-05 14:56:09,057 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 14:56:09,061 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-05 14:56:09,061 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-05 14:56:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 1042 states, 1040 states have (on average 1.4942307692307693) internal successors, (1554), 1041 states have internal predecessors, (1554), 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-05 14:56:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-05 14:56:09,101 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:56:09,102 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] [2021-11-05 14:56:09,102 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:56:09,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:56:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash -864679343, now seen corresponding path program 1 times [2021-11-05 14:56:09,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:56:09,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169361768] [2021-11-05 14:56:09,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:56:09,114 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:56:09,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:56:09,118 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:56:09,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-05 14:56:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:56:09,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-05 14:56:09,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:56:09,688 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-05 14:56:09,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:56:09,769 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-05 14:56:09,770 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:56:09,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169361768] [2021-11-05 14:56:09,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169361768] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:56:09,771 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:56:09,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-05 14:56:09,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62175209] [2021-11-05 14:56:09,773 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:56:09,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 14:56:09,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:56:09,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 14:56:09,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:56:09,812 INFO L87 Difference]: Start difference. First operand has 1042 states, 1040 states have (on average 1.4942307692307693) internal successors, (1554), 1041 states have internal predecessors, (1554), 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 4 states, 4 states have (on average 10.75) 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-05 14:56:09,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:56:09,926 INFO L93 Difference]: Finished difference Result 2079 states and 3101 transitions. [2021-11-05 14:56:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:56:09,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) 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 36 [2021-11-05 14:56:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:56:09,945 INFO L225 Difference]: With dead ends: 2079 [2021-11-05 14:56:09,945 INFO L226 Difference]: Without dead ends: 1011 [2021-11-05 14:56:09,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.75ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-05 14:56:09,955 INFO L933 BasicCegarLoop]: 1528 mSDtfsCounter, 1534 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.73ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.68ms IncrementalHoareTripleChecker+Time [2021-11-05 14:56:09,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1534 Valid, 1528 Invalid, 12 Unknown, 0 Unchecked, 9.73ms Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 25.68ms Time] [2021-11-05 14:56:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-11-05 14:56:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2021-11-05 14:56:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.4772277227722772) internal successors, (1492), 1010 states have internal predecessors, (1492), 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-05 14:56:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1492 transitions. [2021-11-05 14:56:10,032 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1492 transitions. Word has length 36 [2021-11-05 14:56:10,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:56:10,033 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1492 transitions. [2021-11-05 14:56:10,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) 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-05 14:56:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1492 transitions. [2021-11-05 14:56:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-05 14:56:10,037 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:56:10,038 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] [2021-11-05 14:56:10,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-05 14:56:10,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:56:10,244 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:56:10,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:56:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash -842047089, now seen corresponding path program 1 times [2021-11-05 14:56:10,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:56:10,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204886935] [2021-11-05 14:56:10,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:56:10,246 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:56:10,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:56:10,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:56:10,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-05 14:56:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:56:10,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 14:56:10,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:56:10,675 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-05 14:56:10,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:56:10,750 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-05 14:56:10,750 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:56:10,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204886935] [2021-11-05 14:56:10,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204886935] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:56:10,751 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:56:10,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-05 14:56:10,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118625502] [2021-11-05 14:56:10,752 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:56:10,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 14:56:10,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:56:10,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 14:56:10,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-05 14:56:10,754 INFO L87 Difference]: Start difference. First operand 1011 states and 1492 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-05 14:56:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:56:10,803 INFO L93 Difference]: Finished difference Result 1999 states and 2957 transitions. [2021-11-05 14:56:10,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 14:56:10,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 36 [2021-11-05 14:56:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:56:10,807 INFO L225 Difference]: With dead ends: 1999 [2021-11-05 14:56:10,807 INFO L226 Difference]: Without dead ends: 1011 [2021-11-05 14:56:10,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.60ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 14:56:10,809 INFO L933 BasicCegarLoop]: 1491 mSDtfsCounter, 2 mSDsluCounter, 2977 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.65ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.69ms IncrementalHoareTripleChecker+Time [2021-11-05 14:56:10,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 4468 Invalid, 7 Unknown, 0 Unchecked, 4.65ms Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 10.69ms Time] [2021-11-05 14:56:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-11-05 14:56:10,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2021-11-05 14:56:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.4762376237623762) internal successors, (1491), 1010 states have internal predecessors, (1491), 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-05 14:56:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1491 transitions. [2021-11-05 14:56:10,830 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1491 transitions. Word has length 36 [2021-11-05 14:56:10,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:56:10,830 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1491 transitions. [2021-11-05 14:56:10,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-05 14:56:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1491 transitions. [2021-11-05 14:56:10,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-05 14:56:10,832 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:56:10,832 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] [2021-11-05 14:56:10,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-05 14:56:11,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:56:11,043 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:56:11,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:56:11,044 INFO L85 PathProgramCache]: Analyzing trace with hash 44746728, now seen corresponding path program 1 times [2021-11-05 14:56:11,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:56:11,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855696548] [2021-11-05 14:56:11,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:56:11,045 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:56:11,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:56:11,046 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:56:11,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-05 14:56:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:56:11,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-05 14:56:11,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:56:11,535 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-05 14:56:11,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:56:11,717 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-05 14:56:11,717 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:56:11,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855696548] [2021-11-05 14:56:11,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855696548] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:56:11,717 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:56:11,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-11-05 14:56:11,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27754290] [2021-11-05 14:56:11,717 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:56:11,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-05 14:56:11,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:56:11,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-05 14:56:11,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-05 14:56:11,718 INFO L87 Difference]: Start difference. First operand 1011 states and 1491 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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-05 14:56:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:56:14,480 INFO L93 Difference]: Finished difference Result 8366 states and 12465 transitions. [2021-11-05 14:56:14,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-05 14:56:14,482 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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 39 [2021-11-05 14:56:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:56:14,519 INFO L225 Difference]: With dead ends: 8366 [2021-11-05 14:56:14,522 INFO L226 Difference]: Without dead ends: 7370 [2021-11-05 14:56:14,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 419.33ms TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2021-11-05 14:56:14,529 INFO L933 BasicCegarLoop]: 5268 mSDtfsCounter, 19603 mSDsluCounter, 37681 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1695.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 19603 SdHoareTripleChecker+Valid, 42949 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 42.88ms SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1986.36ms IncrementalHoareTripleChecker+Time [2021-11-05 14:56:14,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19603 Valid, 42949 Invalid, 711 Unknown, 0 Unchecked, 42.88ms Time], IncrementalHoareTripleChecker [72 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 1986.36ms Time] [2021-11-05 14:56:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7370 states. [2021-11-05 14:56:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7370 to 1972. [2021-11-05 14:56:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1971 states have (on average 1.4814814814814814) internal successors, (2920), 1971 states have internal predecessors, (2920), 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-05 14:56:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 2920 transitions. [2021-11-05 14:56:14,616 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 2920 transitions. Word has length 39 [2021-11-05 14:56:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:56:14,617 INFO L470 AbstractCegarLoop]: Abstraction has 1972 states and 2920 transitions. [2021-11-05 14:56:14,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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-05 14:56:14,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2920 transitions. [2021-11-05 14:56:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-05 14:56:14,619 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:56:14,619 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-05 14:56:14,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-05 14:56:14,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:56:14,831 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:56:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:56:14,832 INFO L85 PathProgramCache]: Analyzing trace with hash 713639092, now seen corresponding path program 1 times [2021-11-05 14:56:14,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:56:14,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752973872] [2021-11-05 14:56:14,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:56:14,834 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:56:14,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:56:14,835 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:56:14,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-05 14:56:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:56:15,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-05 14:56:15,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:56:15,257 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-05 14:56:15,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:56:15,322 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-05 14:56:15,322 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:56:15,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752973872] [2021-11-05 14:56:15,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752973872] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:56:15,323 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:56:15,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-05 14:56:15,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137470581] [2021-11-05 14:56:15,323 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:56:15,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 14:56:15,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:56:15,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 14:56:15,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-05 14:56:15,324 INFO L87 Difference]: Start difference. First operand 1972 states and 2920 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-05 14:56:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:56:15,708 INFO L93 Difference]: Finished difference Result 6659 states and 9888 transitions. [2021-11-05 14:56:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-05 14:56:15,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-05 14:56:15,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:56:15,729 INFO L225 Difference]: With dead ends: 6659 [2021-11-05 14:56:15,729 INFO L226 Difference]: Without dead ends: 6657 [2021-11-05 14:56:15,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 44.63ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-11-05 14:56:15,732 INFO L933 BasicCegarLoop]: 2944 mSDtfsCounter, 6531 mSDsluCounter, 10296 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6531 SdHoareTripleChecker+Valid, 13240 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.77ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.30ms IncrementalHoareTripleChecker+Time [2021-11-05 14:56:15,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6531 Valid, 13240 Invalid, 31 Unknown, 0 Unchecked, 9.77ms Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 57.30ms Time] [2021-11-05 14:56:15,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6657 states. [2021-11-05 14:56:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6657 to 1976. [2021-11-05 14:56:15,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1975 states have (on average 1.480506329113924) internal successors, (2924), 1975 states have internal predecessors, (2924), 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-05 14:56:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 2924 transitions. [2021-11-05 14:56:15,848 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 2924 transitions. Word has length 42 [2021-11-05 14:56:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:56:15,848 INFO L470 AbstractCegarLoop]: Abstraction has 1976 states and 2924 transitions. [2021-11-05 14:56:15,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-05 14:56:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2924 transitions. [2021-11-05 14:56:15,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-05 14:56:15,850 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:56:15,851 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, 1, 1, 1, 1, 1, 1] [2021-11-05 14:56:15,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-05 14:56:16,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:56:16,066 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:56:16,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:56:16,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1808756799, now seen corresponding path program 1 times [2021-11-05 14:56:16,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:56:16,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813197670] [2021-11-05 14:56:16,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:56:16,068 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:56:16,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:56:16,069 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:56:16,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-05 14:56:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:56:16,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 14:56:16,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:56:16,534 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-05 14:56:16,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:56:16,644 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-05 14:56:16,644 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:56:16,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813197670] [2021-11-05 14:56:16,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813197670] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:56:16,644 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:56:16,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-05 14:56:16,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906931733] [2021-11-05 14:56:16,644 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:56:16,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 14:56:16,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:56:16,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 14:56:16,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-05 14:56:16,645 INFO L87 Difference]: Start difference. First operand 1976 states and 2924 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 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-05 14:56:18,461 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:56:20,478 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:56:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:56:20,815 INFO L93 Difference]: Finished difference Result 7813 states and 11591 transitions. [2021-11-05 14:56:20,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 14:56:20,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 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 49 [2021-11-05 14:56:20,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:56:20,833 INFO L225 Difference]: With dead ends: 7813 [2021-11-05 14:56:20,834 INFO L226 Difference]: Without dead ends: 5862 [2021-11-05 14:56:20,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 23.78ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-05 14:56:20,838 INFO L933 BasicCegarLoop]: 2691 mSDtfsCounter, 6296 mSDsluCounter, 4156 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3852.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6296 SdHoareTripleChecker+Valid, 6847 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.06ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3898.71ms IncrementalHoareTripleChecker+Time [2021-11-05 14:56:20,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6296 Valid, 6847 Invalid, 36 Unknown, 0 Unchecked, 9.06ms Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 1 Unknown, 0 Unchecked, 3898.71ms Time] [2021-11-05 14:56:20,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2021-11-05 14:56:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 1996. [2021-11-05 14:56:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1996 states, 1995 states have (on average 1.4796992481203008) internal successors, (2952), 1995 states have internal predecessors, (2952), 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-05 14:56:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2952 transitions. [2021-11-05 14:56:20,969 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2952 transitions. Word has length 49 [2021-11-05 14:56:20,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:56:20,969 INFO L470 AbstractCegarLoop]: Abstraction has 1996 states and 2952 transitions. [2021-11-05 14:56:20,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 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-05 14:56:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2952 transitions. [2021-11-05 14:56:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-05 14:56:20,971 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:56:20,971 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:56:20,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-05 14:56:21,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:56:21,185 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:56:21,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:56:21,186 INFO L85 PathProgramCache]: Analyzing trace with hash 287427040, now seen corresponding path program 1 times [2021-11-05 14:56:21,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:56:21,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286443590] [2021-11-05 14:56:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:56:21,187 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:56:21,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:56:21,191 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:56:21,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-05 14:56:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:56:21,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-05 14:56:21,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:56:21,609 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-05 14:56:21,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:56:21,691 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-05 14:56:21,692 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:56:21,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286443590] [2021-11-05 14:56:21,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286443590] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:56:21,692 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:56:21,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-05 14:56:21,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011525625] [2021-11-05 14:56:21,692 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:56:21,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 14:56:21,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:56:21,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 14:56:21,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:56:21,693 INFO L87 Difference]: Start difference. First operand 1996 states and 2952 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-05 14:56:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:56:22,528 INFO L93 Difference]: Finished difference Result 9962 states and 14800 transitions. [2021-11-05 14:56:22,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-05 14:56:22,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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 51 [2021-11-05 14:56:22,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:56:22,562 INFO L225 Difference]: With dead ends: 9962 [2021-11-05 14:56:22,562 INFO L226 Difference]: Without dead ends: 9960 [2021-11-05 14:56:22,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 139.88ms TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2021-11-05 14:56:22,567 INFO L933 BasicCegarLoop]: 4400 mSDtfsCounter, 11526 mSDsluCounter, 18231 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 169.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11526 SdHoareTripleChecker+Valid, 22631 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.91ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 196.55ms IncrementalHoareTripleChecker+Time [2021-11-05 14:56:22,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11526 Valid, 22631 Invalid, 120 Unknown, 0 Unchecked, 17.91ms Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 196.55ms Time] [2021-11-05 14:56:22,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9960 states. [2021-11-05 14:56:22,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9960 to 1998. [2021-11-05 14:56:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1998 states, 1997 states have (on average 1.4792188282423635) internal successors, (2954), 1997 states have internal predecessors, (2954), 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-05 14:56:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2954 transitions. [2021-11-05 14:56:22,765 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 2954 transitions. Word has length 51 [2021-11-05 14:56:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:56:22,765 INFO L470 AbstractCegarLoop]: Abstraction has 1998 states and 2954 transitions. [2021-11-05 14:56:22,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-05 14:56:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2954 transitions. [2021-11-05 14:56:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-05 14:56:22,767 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:56:22,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 14:56:22,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-05 14:56:22,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:56:22,979 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:56:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:56:22,980 INFO L85 PathProgramCache]: Analyzing trace with hash -755149405, now seen corresponding path program 1 times [2021-11-05 14:56:22,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:56:22,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694842169] [2021-11-05 14:56:22,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:56:22,981 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:56:22,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:56:22,982 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:56:22,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-05 14:56:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:56:23,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-05 14:56:23,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:56:23,569 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-05 14:56:23,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:56:23,734 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-05 14:56:23,734 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:56:23,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694842169] [2021-11-05 14:56:23,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694842169] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:56:23,734 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:56:23,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-05 14:56:23,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763257498] [2021-11-05 14:56:23,734 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:56:23,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 14:56:23,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:56:23,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 14:56:23,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:56:23,735 INFO L87 Difference]: Start difference. First operand 1998 states and 2954 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-05 14:56:25,347 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:56:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:56:25,557 INFO L93 Difference]: Finished difference Result 2000 states and 2955 transitions. [2021-11-05 14:56:25,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:56:25,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 65 [2021-11-05 14:56:25,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:56:25,567 INFO L225 Difference]: With dead ends: 2000 [2021-11-05 14:56:25,567 INFO L226 Difference]: Without dead ends: 1024 [2021-11-05 14:56:25,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.60ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:56:25,570 INFO L933 BasicCegarLoop]: 1474 mSDtfsCounter, 1437 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1699.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.71ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1762.17ms IncrementalHoareTripleChecker+Time [2021-11-05 14:56:25,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1437 Valid, 1492 Invalid, 17 Unknown, 0 Unchecked, 1.71ms Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1762.17ms Time] [2021-11-05 14:56:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2021-11-05 14:56:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2021-11-05 14:56:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 1.4721407624633431) internal successors, (1506), 1023 states have internal predecessors, (1506), 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-05 14:56:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1506 transitions. [2021-11-05 14:56:25,643 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1506 transitions. Word has length 65 [2021-11-05 14:56:25,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:56:25,643 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 1506 transitions. [2021-11-05 14:56:25,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-05 14:56:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1506 transitions. [2021-11-05 14:56:25,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-05 14:56:25,645 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:56:25,645 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, 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-05 14:56:25,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-05 14:56:25,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:56:25,863 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:56:25,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:56:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash -436055095, now seen corresponding path program 1 times [2021-11-05 14:56:25,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:56:25,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240463480] [2021-11-05 14:56:25,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:56:25,864 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:56:25,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:56:25,865 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:56:25,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-05 14:56:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:56:26,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 14:56:26,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:56:26,434 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-05 14:56:26,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:56:26,573 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-05 14:56:26,573 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:56:26,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240463480] [2021-11-05 14:56:26,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240463480] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:56:26,573 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:56:26,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-05 14:56:26,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770877209] [2021-11-05 14:56:26,574 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:56:26,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 14:56:26,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:56:26,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 14:56:26,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-05 14:56:26,574 INFO L87 Difference]: Start difference. First operand 1024 states and 1506 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:56:28,614 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:56:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:56:29,048 INFO L93 Difference]: Finished difference Result 3998 states and 5914 transitions. [2021-11-05 14:56:29,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 14:56:29,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-05 14:56:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:56:29,054 INFO L225 Difference]: With dead ends: 3998 [2021-11-05 14:56:29,054 INFO L226 Difference]: Without dead ends: 2999 [2021-11-05 14:56:29,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 22.39ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-05 14:56:29,056 INFO L933 BasicCegarLoop]: 2904 mSDtfsCounter, 5813 mSDsluCounter, 2900 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2224.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5813 SdHoareTripleChecker+Valid, 5804 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.74ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2269.70ms IncrementalHoareTripleChecker+Time [2021-11-05 14:56:29,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5813 Valid, 5804 Invalid, 41 Unknown, 0 Unchecked, 5.74ms Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 2269.70ms Time] [2021-11-05 14:56:29,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2021-11-05 14:56:29,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 1029. [2021-11-05 14:56:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.4708171206225682) internal successors, (1512), 1028 states have internal predecessors, (1512), 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-05 14:56:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1512 transitions. [2021-11-05 14:56:29,147 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1512 transitions. Word has length 67 [2021-11-05 14:56:29,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:56:29,147 INFO L470 AbstractCegarLoop]: Abstraction has 1029 states and 1512 transitions. [2021-11-05 14:56:29,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:56:29,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1512 transitions. [2021-11-05 14:56:29,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-05 14:56:29,149 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:56:29,149 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-05 14:56:29,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-11-05 14:56:29,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:56:29,362 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:56:29,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:56:29,362 INFO L85 PathProgramCache]: Analyzing trace with hash 973079369, now seen corresponding path program 1 times [2021-11-05 14:56:29,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:56:29,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218600953] [2021-11-05 14:56:29,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:56:29,363 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:56:29,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:56:29,364 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:56:29,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-05 14:56:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:56:29,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-05 14:56:29,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:56:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 14:56:29,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:56:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 14:56:30,190 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:56:30,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218600953] [2021-11-05 14:56:30,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218600953] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 14:56:30,190 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-05 14:56:30,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-11-05 14:56:30,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091635600] [2021-11-05 14:56:30,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-05 14:56:30,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-05 14:56:30,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:56:30,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-05 14:56:30,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-05 14:56:30,193 INFO L87 Difference]: Start difference. First operand 1029 states and 1512 transitions. Second operand has 10 states, 10 states have (on average 12.9) internal successors, (129), 9 states have internal predecessors, (129), 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-05 14:56:31,696 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:56:33,481 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:56:35,186 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:56:36,920 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 14:56:38,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:56:38,532 INFO L93 Difference]: Finished difference Result 7995 states and 11824 transitions. [2021-11-05 14:56:38,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 14:56:38,533 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 9 states have internal predecessors, (129), 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 73 [2021-11-05 14:56:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:56:38,550 INFO L225 Difference]: With dead ends: 7995 [2021-11-05 14:56:38,551 INFO L226 Difference]: Without dead ends: 6991 [2021-11-05 14:56:38,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 127.92ms TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2021-11-05 14:56:38,553 INFO L933 BasicCegarLoop]: 5606 mSDtfsCounter, 21770 mSDsluCounter, 17198 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7548.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 21770 SdHoareTripleChecker+Valid, 22804 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.00ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7723.16ms IncrementalHoareTripleChecker+Time [2021-11-05 14:56:38,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21770 Valid, 22804 Invalid, 172 Unknown, 0 Unchecked, 20.00ms Time], IncrementalHoareTripleChecker [19 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 7723.16ms Time] [2021-11-05 14:56:38,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6991 states. [2021-11-05 14:56:38,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6991 to 1041. [2021-11-05 14:56:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 1040 states have (on average 1.4692307692307693) internal successors, (1528), 1040 states have internal predecessors, (1528), 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-05 14:56:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1528 transitions. [2021-11-05 14:56:38,649 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1528 transitions. Word has length 73 [2021-11-05 14:56:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:56:38,649 INFO L470 AbstractCegarLoop]: Abstraction has 1041 states and 1528 transitions. [2021-11-05 14:56:38,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 9 states have internal predecessors, (129), 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-05 14:56:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1528 transitions. [2021-11-05 14:56:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-05 14:56:38,651 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:56:38,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:56:38,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-05 14:56:38,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:56:38,864 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:56:38,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:56:38,864 INFO L85 PathProgramCache]: Analyzing trace with hash 152916243, now seen corresponding path program 1 times [2021-11-05 14:56:38,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:56:38,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340062823] [2021-11-05 14:56:38,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:56:38,865 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:56:38,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:56:38,866 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:56:38,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-05 14:56:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:56:39,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-05 14:56:39,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:56:39,411 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-05 14:56:39,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:56:39,526 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-05 14:56:39,527 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:56:39,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340062823] [2021-11-05 14:56:39,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340062823] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:56:39,527 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:56:39,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-05 14:56:39,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572095597] [2021-11-05 14:56:39,527 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:56:39,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 14:56:39,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:56:39,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 14:56:39,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-05 14:56:39,528 INFO L87 Difference]: Start difference. First operand 1041 states and 1528 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:56:40,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:56:40,113 INFO L93 Difference]: Finished difference Result 4513 states and 6690 transitions. [2021-11-05 14:56:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 14:56:40,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-05 14:56:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:56:40,130 INFO L225 Difference]: With dead ends: 4513 [2021-11-05 14:56:40,130 INFO L226 Difference]: Without dead ends: 3497 [2021-11-05 14:56:40,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 41.70ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 14:56:40,132 INFO L933 BasicCegarLoop]: 2719 mSDtfsCounter, 6056 mSDsluCounter, 9285 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 236.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6056 SdHoareTripleChecker+Valid, 12004 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.20ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 272.90ms IncrementalHoareTripleChecker+Time [2021-11-05 14:56:40,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6056 Valid, 12004 Invalid, 33 Unknown, 0 Unchecked, 8.20ms Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 272.90ms Time] [2021-11-05 14:56:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2021-11-05 14:56:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 1043. [2021-11-05 14:56:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 1042 states have (on average 1.4683301343570057) internal successors, (1530), 1042 states have internal predecessors, (1530), 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-05 14:56:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1530 transitions. [2021-11-05 14:56:40,222 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1530 transitions. Word has length 75 [2021-11-05 14:56:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:56:40,223 INFO L470 AbstractCegarLoop]: Abstraction has 1043 states and 1530 transitions. [2021-11-05 14:56:40,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 14:56:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1530 transitions. [2021-11-05 14:56:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-05 14:56:40,228 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:56:40,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:56:40,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-05 14:56:40,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:56:40,442 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:56:40,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:56:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash 800611437, now seen corresponding path program 1 times [2021-11-05 14:56:40,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:56:40,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669947646] [2021-11-05 14:56:40,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:56:40,443 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:56:40,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:56:40,444 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:56:40,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-05 14:56:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:56:40,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-05 14:56:40,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:56:41,013 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-05 14:56:41,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:56:41,119 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-05 14:56:41,119 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:56:41,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669947646] [2021-11-05 14:56:41,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669947646] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:56:41,119 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:56:41,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-05 14:56:41,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117088585] [2021-11-05 14:56:41,119 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:56:41,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 14:56:41,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:56:41,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 14:56:41,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:56:41,120 INFO L87 Difference]: Start difference. First operand 1043 states and 1530 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-05 14:56:41,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:56:41,469 INFO L93 Difference]: Finished difference Result 2901 states and 4285 transitions. [2021-11-05 14:56:41,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:56:41,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2021-11-05 14:56:41,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:56:41,473 INFO L225 Difference]: With dead ends: 2901 [2021-11-05 14:56:41,473 INFO L226 Difference]: Without dead ends: 1883 [2021-11-05 14:56:41,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.50ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:56:41,475 INFO L933 BasicCegarLoop]: 2719 mSDtfsCounter, 1243 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 155.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 4185 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.94ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 174.80ms IncrementalHoareTripleChecker+Time [2021-11-05 14:56:41,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1243 Valid, 4185 Invalid, 18 Unknown, 0 Unchecked, 2.94ms Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 174.80ms Time] [2021-11-05 14:56:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2021-11-05 14:56:41,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1045. [2021-11-05 14:56:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 1044 states have (on average 1.4674329501915708) internal successors, (1532), 1044 states have internal predecessors, (1532), 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-05 14:56:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1532 transitions. [2021-11-05 14:56:41,618 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1532 transitions. Word has length 77 [2021-11-05 14:56:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:56:41,618 INFO L470 AbstractCegarLoop]: Abstraction has 1045 states and 1532 transitions. [2021-11-05 14:56:41,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-05 14:56:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1532 transitions. [2021-11-05 14:56:41,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-05 14:56:41,620 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:56:41,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:56:41,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-05 14:56:41,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:56:41,821 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:56:41,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:56:41,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1856276453, now seen corresponding path program 1 times [2021-11-05 14:56:41,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:56:41,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603367968] [2021-11-05 14:56:41,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:56:41,822 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:56:41,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:56:41,829 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:56:41,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-05 14:56:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:56:42,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-05 14:56:42,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:56:42,446 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-05 14:56:42,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:56:42,615 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-05 14:56:42,615 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:56:42,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603367968] [2021-11-05 14:56:42,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603367968] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:56:42,615 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:56:42,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-05 14:56:42,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715892283] [2021-11-05 14:56:42,615 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:56:42,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 14:56:42,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:56:42,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 14:56:42,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-05 14:56:42,616 INFO L87 Difference]: Start difference. First operand 1045 states and 1532 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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-05 14:56:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:56:44,580 INFO L93 Difference]: Finished difference Result 8360 states and 12395 transitions. [2021-11-05 14:56:44,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-05 14:56:44,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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 81 [2021-11-05 14:56:44,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:56:44,609 INFO L225 Difference]: With dead ends: 8360 [2021-11-05 14:56:44,609 INFO L226 Difference]: Without dead ends: 7340 [2021-11-05 14:56:44,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 175.74ms TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-11-05 14:56:44,612 INFO L933 BasicCegarLoop]: 4069 mSDtfsCounter, 15829 mSDsluCounter, 23293 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 925.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15829 SdHoareTripleChecker+Valid, 27362 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.62ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1049.20ms IncrementalHoareTripleChecker+Time [2021-11-05 14:56:44,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15829 Valid, 27362 Invalid, 339 Unknown, 0 Unchecked, 21.62ms Time], IncrementalHoareTripleChecker [19 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 1049.20ms Time] [2021-11-05 14:56:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7340 states. [2021-11-05 14:56:44,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7340 to 1048. [2021-11-05 14:56:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1047 states have (on average 1.466093600764088) internal successors, (1535), 1047 states have internal predecessors, (1535), 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-05 14:56:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1535 transitions. [2021-11-05 14:56:44,750 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1535 transitions. Word has length 81 [2021-11-05 14:56:44,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:56:44,751 INFO L470 AbstractCegarLoop]: Abstraction has 1048 states and 1535 transitions. [2021-11-05 14:56:44,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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-05 14:56:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1535 transitions. [2021-11-05 14:56:44,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-05 14:56:44,752 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:56:44,752 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:56:44,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-05 14:56:44,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:56:44,967 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:56:44,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:56:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1754920992, now seen corresponding path program 1 times [2021-11-05 14:56:44,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:56:44,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602175321] [2021-11-05 14:56:44,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:56:44,969 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:56:44,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:56:44,970 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:56:44,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-05 14:56:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:56:45,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-05 14:56:45,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:56:45,600 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-05 14:56:45,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:56:45,708 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-05 14:56:45,708 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 14:56:45,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602175321] [2021-11-05 14:56:45,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602175321] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 14:56:45,708 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 14:56:45,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-05 14:56:45,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679743982] [2021-11-05 14:56:45,709 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 14:56:45,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 14:56:45,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 14:56:45,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 14:56:45,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:56:45,710 INFO L87 Difference]: Start difference. First operand 1048 states and 1535 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-05 14:56:45,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 14:56:45,899 INFO L93 Difference]: Finished difference Result 2080 states and 3052 transitions. [2021-11-05 14:56:45,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 14:56:45,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 84 [2021-11-05 14:56:45,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 14:56:45,901 INFO L225 Difference]: With dead ends: 2080 [2021-11-05 14:56:45,901 INFO L226 Difference]: Without dead ends: 1057 [2021-11-05 14:56:45,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.07ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 14:56:45,904 INFO L933 BasicCegarLoop]: 1443 mSDtfsCounter, 0 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.66ms SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.56ms IncrementalHoareTripleChecker+Time [2021-11-05 14:56:45,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2824 Invalid, 141 Unknown, 0 Unchecked, 1.66ms Time], IncrementalHoareTripleChecker [61 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 84.56ms Time] [2021-11-05 14:56:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2021-11-05 14:56:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1048. [2021-11-05 14:56:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1047 states have (on average 1.440305635148042) internal successors, (1508), 1047 states have internal predecessors, (1508), 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-05 14:56:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1508 transitions. [2021-11-05 14:56:46,030 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1508 transitions. Word has length 84 [2021-11-05 14:56:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 14:56:46,030 INFO L470 AbstractCegarLoop]: Abstraction has 1048 states and 1508 transitions. [2021-11-05 14:56:46,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-05 14:56:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1508 transitions. [2021-11-05 14:56:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-05 14:56:46,032 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 14:56:46,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 14:56:46,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-05 14:56:46,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 14:56:46,248 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 14:56:46,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 14:56:46,249 INFO L85 PathProgramCache]: Analyzing trace with hash -522722400, now seen corresponding path program 1 times [2021-11-05 14:56:46,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 14:56:46,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481764314] [2021-11-05 14:56:46,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 14:56:46,250 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 14:56:46,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 14:56:46,251 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 14:56:46,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-05 14:56:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 14:56:50,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 89 conjunts are in the unsatisfiable core [2021-11-05 14:56:50,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 14:56:50,449 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-05 14:56:50,450 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 2 case distinctions, treesize of input 12 treesize of output 22 [2021-11-05 14:56:50,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:50,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 19 [2021-11-05 14:56:51,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:51,683 INFO L354 Elim1Store]: treesize reduction 250, result has 16.9 percent of original size [2021-11-05 14:56:51,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 62 treesize of output 94 [2021-11-05 14:56:53,418 INFO L354 Elim1Store]: treesize reduction 72, result has 11.1 percent of original size [2021-11-05 14:56:53,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 94 treesize of output 92 [2021-11-05 14:56:54,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:54,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 14:56:54,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2021-11-05 14:56:54,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:54,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:54,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:54,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:54,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:54,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:54,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2021-11-05 14:56:55,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-05 14:56:55,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-05 14:56:55,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2021-11-05 14:56:55,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,511 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 29 treesize of output 13 [2021-11-05 14:56:55,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,535 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 29 treesize of output 13 [2021-11-05 14:56:55,847 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 0 case distinctions, treesize of input 52 treesize of output 45 [2021-11-05 14:56:55,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2021-11-05 14:56:55,878 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 0 case distinctions, treesize of input 52 treesize of output 45 [2021-11-05 14:56:55,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:55,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2021-11-05 14:56:56,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 22 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 76 [2021-11-05 14:56:56,510 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 319 [2021-11-05 14:56:56,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 299 [2021-11-05 14:56:56,547 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 258 [2021-11-05 14:56:56,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 258 [2021-11-05 14:56:56,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:56,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,142 INFO L354 Elim1Store]: treesize reduction 120, result has 18.9 percent of original size [2021-11-05 14:56:57,142 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 6 case distinctions, treesize of input 234 treesize of output 239 [2021-11-05 14:56:57,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,888 INFO L354 Elim1Store]: treesize reduction 126, result has 18.2 percent of original size [2021-11-05 14:56:57,888 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 6 case distinctions, treesize of input 230 treesize of output 235 [2021-11-05 14:56:57,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:57,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:56:58,159 INFO L354 Elim1Store]: treesize reduction 435, result has 16.5 percent of original size [2021-11-05 14:56:58,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 36 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 24 case distinctions, treesize of input 243 treesize of output 217 [2021-11-05 14:57:00,867 INFO L354 Elim1Store]: treesize reduction 376, result has 10.3 percent of original size [2021-11-05 14:57:00,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 481 treesize of output 307 [2021-11-05 14:57:01,206 INFO L354 Elim1Store]: treesize reduction 706, result has 9.7 percent of original size [2021-11-05 14:57:01,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 466 treesize of output 463 [2021-11-05 14:57:01,449 INFO L354 Elim1Store]: treesize reduction 1312, result has 10.0 percent of original size [2021-11-05 14:57:01,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 451 treesize of output 456 [2021-11-05 14:57:01,968 INFO L354 Elim1Store]: treesize reduction 1376, result has 9.5 percent of original size [2021-11-05 14:57:01,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 432 treesize of output 437 [2021-11-05 14:57:03,570 INFO L354 Elim1Store]: treesize reduction 400, result has 11.5 percent of original size [2021-11-05 14:57:03,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 464 treesize of output 292 [2021-11-05 14:57:03,872 INFO L354 Elim1Store]: treesize reduction 524, result has 11.9 percent of original size [2021-11-05 14:57:03,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 263 treesize of output 283 [2021-11-05 14:57:04,131 INFO L354 Elim1Store]: treesize reduction 448, result has 11.5 percent of original size [2021-11-05 14:57:04,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 250 treesize of output 249 [2021-11-05 14:57:14,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,204 INFO L354 Elim1Store]: treesize reduction 248, result has 8.1 percent of original size [2021-11-05 14:57:14,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 177 treesize of output 176 [2021-11-05 14:57:14,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,335 INFO L354 Elim1Store]: treesize reduction 248, result has 8.1 percent of original size [2021-11-05 14:57:14,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 158 treesize of output 157 [2021-11-05 14:57:14,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:14,785 INFO L354 Elim1Store]: treesize reduction 161, result has 5.3 percent of original size [2021-11-05 14:57:14,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 107 treesize of output 130 [2021-11-05 14:57:25,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,467 INFO L354 Elim1Store]: treesize reduction 360, result has 5.8 percent of original size [2021-11-05 14:57:25,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 199 treesize of output 187 [2021-11-05 14:57:25,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:25,687 INFO L354 Elim1Store]: treesize reduction 360, result has 5.8 percent of original size [2021-11-05 14:57:25,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 169 treesize of output 157 [2021-11-05 14:57:26,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 14:57:26,197 INFO L244 Elim1Store]: Index analysis took 127 ms [2021-11-05 14:57:26,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 55 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 155 [2021-11-05 14:57:38,175 INFO L354 Elim1Store]: treesize reduction 360, result has 12.2 percent of original size [2021-11-05 14:57:38,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 505 treesize of output 321 [2021-11-05 14:57:38,269 INFO L354 Elim1Store]: treesize reduction 133, result has 0.7 percent of original size [2021-11-05 14:57:38,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 768 treesize of output 286 [2021-11-05 14:57:38,757 INFO L354 Elim1Store]: treesize reduction 322, result has 2.1 percent of original size [2021-11-05 14:57:38,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 55 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 395 treesize of output 313 [2021-11-05 14:57:39,198 INFO L354 Elim1Store]: treesize reduction 320, result has 13.0 percent of original size [2021-11-05 14:57:39,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 252 treesize of output 240 [2021-11-05 14:57:39,265 INFO L354 Elim1Store]: treesize reduction 133, result has 0.7 percent of original size [2021-11-05 14:57:39,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 225 treesize of output 151 [2021-11-05 14:57:40,039 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-05 14:57:40,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 14:58:15,361 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse11 (bvadd (_ bv4 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse12 (bvadd c_ULTIMATE.start_slip_open_~sl~12.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse13 (let ((.cse14 (let ((.cse18 (store |c_#memory_int| c_ULTIMATE.start_slip_open_~sl~12.base (store (select |c_#memory_int| c_ULTIMATE.start_slip_open_~sl~12.base) .cse11 v_DerPreprocessor_21)))) (store .cse18 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse18 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse14 c_ULTIMATE.start_slip_open_~sl~12.base (let ((.cse15 (let ((.cse17 (store (select .cse14 c_ULTIMATE.start_slip_open_~sl~12.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse17 .cse6 (select (select (store .cse14 c_ULTIMATE.start_slip_open_~sl~12.base .cse17) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse16 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse15 (bvadd c_ULTIMATE.start_slip_open_~sl~12.offset (_ bv190 64))))) (_ bv250 32)))))) (store (store .cse15 .cse7 ((_ extract 31 0) .cse16)) .cse8 ((_ extract 63 32) .cse16)))))))) (store .cse13 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse13 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse19 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_slip_open_~sl~12.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_slip_open_~sl~12.base) .cse11 c_ULTIMATE.start_slip_open_~tty.base)))) (store .cse21 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse21 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_slip_open_~sl~12.base))))) (store .cse20 c_ULTIMATE.start_slip_open_~sl~12.base (store (store (store (store (select .cse20 c_ULTIMATE.start_slip_open_~sl~12.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse19 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse19 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_slip_open_~sl~12.base) .cse12))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_slip_open_~sl~12.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_slip_open_~sl~12.base) .cse11 ULTIMATE.start_slip_open_~tty.offset)))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_slip_open_~sl~12.offset))))) (store .cse4 c_ULTIMATE.start_slip_open_~sl~12.base (store (store (store (store (select .cse4 c_ULTIMATE.start_slip_open_~sl~12.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_slip_open_~sl~12.base) .cse12))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from false [2021-11-05 14:58:19,911 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)) (.cse6 (bvadd (_ bv186 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)) (.cse7 (bvadd (_ bv208 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)) (.cse8 (bvadd (_ bv212 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse11 (bvadd (_ bv4 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)) (.cse12 (bvadd |c_ULTIMATE.start_sl_alloc_#res.offset| (_ bv12 64)))) (let ((.cse0 (select (let ((.cse13 (let ((.cse14 (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_sl_alloc_#res.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sl_alloc_#res.base|) .cse11 v_DerPreprocessor_21)))) (store .cse18 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse18 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse14 |c_ULTIMATE.start_sl_alloc_#res.base| (let ((.cse15 (let ((.cse17 (store (select .cse14 |c_ULTIMATE.start_sl_alloc_#res.base|) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse17 .cse6 (select (select (store .cse14 |c_ULTIMATE.start_sl_alloc_#res.base| .cse17) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse16 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse15 (bvadd (_ bv190 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)))) (_ bv250 32)))))) (store (store .cse15 .cse7 ((_ extract 31 0) .cse16)) .cse8 ((_ extract 63 32) .cse16)))))))) (store .cse13 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse13 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse19 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sl_alloc_#res.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sl_alloc_#res.base|) .cse11 c_ULTIMATE.start_slip_open_~tty.base)))) (store .cse21 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse21 c_ULTIMATE.start_slip_open_~tty.base) .cse10 |c_ULTIMATE.start_sl_alloc_#res.base|))))) (store .cse20 |c_ULTIMATE.start_sl_alloc_#res.base| (store (store (store (store (select .cse20 |c_ULTIMATE.start_sl_alloc_#res.base|) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse19 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse19 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) |c_ULTIMATE.start_sl_alloc_#res.base|) .cse12))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sl_alloc_#res.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sl_alloc_#res.base|) .cse11 ULTIMATE.start_slip_open_~tty.offset)))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 |c_ULTIMATE.start_sl_alloc_#res.offset|))))) (store .cse4 |c_ULTIMATE.start_sl_alloc_#res.base| (store (store (store (store (select .cse4 |c_ULTIMATE.start_sl_alloc_#res.base|) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) |c_ULTIMATE.start_sl_alloc_#res.base|) .cse12))) (concat (select .cse0 (bvadd .cse1 (_ bv116 64))) (select .cse0 (bvadd .cse1 (_ bv112 64))))))) (_ bv0 32))) is different from false [2021-11-05 14:58:56,513 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse16 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse19 (let ((.cse20 (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse27 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 ((_ extract 31 0) .cse27)) .cse16 ((_ extract 63 32) .cse27))) .cse17 v_DerPreprocessor_25)))) (store .cse26 c_~slip_devs~0.base (store (select .cse26 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse25 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse25 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse24 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse24 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse21 (let ((.cse23 (store (select .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse23 .cse6 (select (select (store .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse23) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse22 (bvadd ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse21 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32))) ~jiffies~0))) (store (store .cse21 .cse7 ((_ extract 31 0) .cse22)) .cse8 ((_ extract 63 32) .cse22)))))))) (store .cse19 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse19 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse28 (let ((.cse29 (let ((.cse30 (let ((.cse31 (let ((.cse32 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_22) .cse16 v_DerPreprocessor_23) .cse17 |#funAddr~sl_outfill.base|)))) (store .cse32 c_~slip_devs~0.base (store (select .cse32 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse31 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse31 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse30 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse30 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse28 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse28 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse18))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_26) .cse16 v_DerPreprocessor_27) .cse17 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse18))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from false [2021-11-05 14:58:58,537 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse16 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse19 (let ((.cse20 (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse27 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 ((_ extract 31 0) .cse27)) .cse16 ((_ extract 63 32) .cse27))) .cse17 v_DerPreprocessor_25)))) (store .cse26 c_~slip_devs~0.base (store (select .cse26 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse25 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse25 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse24 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse24 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse21 (let ((.cse23 (store (select .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse23 .cse6 (select (select (store .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse23) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse22 (bvadd ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse21 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32))) ~jiffies~0))) (store (store .cse21 .cse7 ((_ extract 31 0) .cse22)) .cse8 ((_ extract 63 32) .cse22)))))))) (store .cse19 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse19 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse28 (let ((.cse29 (let ((.cse30 (let ((.cse31 (let ((.cse32 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_22) .cse16 v_DerPreprocessor_23) .cse17 |#funAddr~sl_outfill.base|)))) (store .cse32 c_~slip_devs~0.base (store (select .cse32 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse31 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse31 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse30 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse30 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse28 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse28 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse18))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_26) .cse16 v_DerPreprocessor_27) .cse17 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse18))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from true [2021-11-05 14:59:46,630 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_31 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64)) (v_DerPreprocessor_32 (_ BitVec 64)) (v_DerPreprocessor_30 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd (_ bv356 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse16 (bvadd (_ bv360 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv348 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse19 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse20 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse21 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse22 (let ((.cse23 (let ((.cse27 (let ((.cse28 (let ((.cse29 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse32 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (let ((.cse31 ((_ extract 63 32) .cse32))) (store (let ((.cse30 ((_ extract 31 0) .cse32))) (store (store (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 .cse30) .cse16 .cse31) .cse17 v_DerPreprocessor_28) .cse18 .cse30)) .cse19 .cse31))) .cse20 v_DerPreprocessor_25)))) (store .cse29 c_~slip_devs~0.base (store (select .cse29 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse28 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse28 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse27 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse27 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse24 (let ((.cse26 (store (select .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse26 .cse6 (select (select (store .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse26) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse25 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse24 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32)))))) (store (store .cse24 .cse7 ((_ extract 31 0) .cse25)) .cse8 ((_ extract 63 32) .cse25)))))))) (store .cse22 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse22 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse33 (let ((.cse34 (let ((.cse35 (let ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_29) .cse16 v_DerPreprocessor_30) .cse17 |#funAddr~sl_keepalive.base|) .cse18 v_DerPreprocessor_22) .cse19 v_DerPreprocessor_23) .cse20 |#funAddr~sl_outfill.base|)))) (store .cse37 c_~slip_devs~0.base (store (select .cse37 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse36 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse36 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse35 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse35 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse34 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse34 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse33 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse33 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse21))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_31) .cse16 v_DerPreprocessor_32) .cse17 |#funAddr~sl_keepalive.offset|) .cse18 v_DerPreprocessor_26) .cse19 v_DerPreprocessor_27) .cse20 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse21))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from false [2021-11-05 14:59:48,657 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_31 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64)) (v_DerPreprocessor_32 (_ BitVec 64)) (v_DerPreprocessor_30 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd (_ bv356 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse16 (bvadd (_ bv360 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv348 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse19 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse20 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse21 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse22 (let ((.cse23 (let ((.cse27 (let ((.cse28 (let ((.cse29 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse32 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (let ((.cse31 ((_ extract 63 32) .cse32))) (store (let ((.cse30 ((_ extract 31 0) .cse32))) (store (store (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 .cse30) .cse16 .cse31) .cse17 v_DerPreprocessor_28) .cse18 .cse30)) .cse19 .cse31))) .cse20 v_DerPreprocessor_25)))) (store .cse29 c_~slip_devs~0.base (store (select .cse29 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse28 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse28 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse27 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse27 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse24 (let ((.cse26 (store (select .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse26 .cse6 (select (select (store .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse26) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse25 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse24 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32)))))) (store (store .cse24 .cse7 ((_ extract 31 0) .cse25)) .cse8 ((_ extract 63 32) .cse25)))))))) (store .cse22 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse22 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse33 (let ((.cse34 (let ((.cse35 (let ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_29) .cse16 v_DerPreprocessor_30) .cse17 |#funAddr~sl_keepalive.base|) .cse18 v_DerPreprocessor_22) .cse19 v_DerPreprocessor_23) .cse20 |#funAddr~sl_outfill.base|)))) (store .cse37 c_~slip_devs~0.base (store (select .cse37 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse36 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse36 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse35 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse35 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse34 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse34 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse33 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse33 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse21))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_31) .cse16 v_DerPreprocessor_32) .cse17 |#funAddr~sl_keepalive.offset|) .cse18 v_DerPreprocessor_26) .cse19 v_DerPreprocessor_27) .cse20 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse21))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from true [2021-11-05 15:00:19,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_33 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_34 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_31 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64)) (v_DerPreprocessor_32 (_ BitVec 64)) (v_DerPreprocessor_30 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv180 64))) (.cse16 (bvadd (_ bv356 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv360 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd (_ bv348 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse19 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse20 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse21 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse22 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse23 (let ((.cse24 (let ((.cse28 (let ((.cse29 (let ((.cse30 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse33 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (let ((.cse32 ((_ extract 63 32) .cse33))) (store (let ((.cse31 ((_ extract 31 0) .cse33))) (store (store (store (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 ((_ sign_extend 24) (_ bv8 8))) .cse16 .cse31) .cse17 .cse32) .cse18 v_DerPreprocessor_28) .cse19 .cse31)) .cse20 .cse32))) .cse21 v_DerPreprocessor_25)))) (store .cse30 c_~slip_devs~0.base (store (select .cse30 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse28 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse28 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse25 (let ((.cse27 (store (select .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse27 .cse6 (select (select (store .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse27) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse26 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse25 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32)))))) (store (store .cse25 .cse7 ((_ extract 31 0) .cse26)) .cse8 ((_ extract 63 32) .cse26)))))))) (store .cse23 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse23 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse34 (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_33) .cse16 v_DerPreprocessor_29) .cse17 v_DerPreprocessor_30) .cse18 |#funAddr~sl_keepalive.base|) .cse19 v_DerPreprocessor_22) .cse20 v_DerPreprocessor_23) .cse21 |#funAddr~sl_outfill.base|)))) (store .cse38 c_~slip_devs~0.base (store (select .cse38 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse37 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse37 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse36 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse36 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse35 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse35 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse34 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse34 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse22))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_34) .cse16 v_DerPreprocessor_31) .cse17 v_DerPreprocessor_32) .cse18 |#funAddr~sl_keepalive.offset|) .cse19 v_DerPreprocessor_26) .cse20 v_DerPreprocessor_27) .cse21 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse22))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from false [2021-11-05 15:00:21,769 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_33 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_34 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_31 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64)) (v_DerPreprocessor_32 (_ BitVec 64)) (v_DerPreprocessor_30 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv180 64))) (.cse16 (bvadd (_ bv356 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv360 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd (_ bv348 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse19 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse20 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse21 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse22 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse23 (let ((.cse24 (let ((.cse28 (let ((.cse29 (let ((.cse30 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse33 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (let ((.cse32 ((_ extract 63 32) .cse33))) (store (let ((.cse31 ((_ extract 31 0) .cse33))) (store (store (store (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 ((_ sign_extend 24) (_ bv8 8))) .cse16 .cse31) .cse17 .cse32) .cse18 v_DerPreprocessor_28) .cse19 .cse31)) .cse20 .cse32))) .cse21 v_DerPreprocessor_25)))) (store .cse30 c_~slip_devs~0.base (store (select .cse30 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse28 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse28 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse25 (let ((.cse27 (store (select .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse27 .cse6 (select (select (store .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse27) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse26 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse25 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32)))))) (store (store .cse25 .cse7 ((_ extract 31 0) .cse26)) .cse8 ((_ extract 63 32) .cse26)))))))) (store .cse23 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse23 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse34 (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_33) .cse16 v_DerPreprocessor_29) .cse17 v_DerPreprocessor_30) .cse18 |#funAddr~sl_keepalive.base|) .cse19 v_DerPreprocessor_22) .cse20 v_DerPreprocessor_23) .cse21 |#funAddr~sl_outfill.base|)))) (store .cse38 c_~slip_devs~0.base (store (select .cse38 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse37 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse37 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse36 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse36 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse35 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse35 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse34 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse34 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse22))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_34) .cse16 v_DerPreprocessor_31) .cse17 v_DerPreprocessor_32) .cse18 |#funAddr~sl_keepalive.offset|) .cse19 v_DerPreprocessor_26) .cse20 v_DerPreprocessor_27) .cse21 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse22))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from true