./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 0f8a17c6 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-dev-0f8a17c [2021-11-16 22:46:42,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 22:46:42,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 22:46:42,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 22:46:42,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 22:46:42,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 22:46:42,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 22:46:42,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 22:46:42,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 22:46:42,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 22:46:42,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 22:46:42,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 22:46:42,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 22:46:42,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 22:46:42,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 22:46:42,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 22:46:42,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 22:46:42,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 22:46:42,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 22:46:42,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 22:46:42,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 22:46:42,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 22:46:42,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 22:46:42,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 22:46:42,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 22:46:42,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 22:46:42,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 22:46:42,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 22:46:42,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 22:46:42,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 22:46:42,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 22:46:42,967 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 22:46:42,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 22:46:42,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 22:46:42,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 22:46:42,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 22:46:42,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 22:46:42,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 22:46:42,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 22:46:42,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 22:46:42,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 22:46:42,972 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 22:46:42,998 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 22:46:42,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 22:46:42,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 22:46:42,999 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 22:46:42,999 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 22:46:43,000 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 22:46:43,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 22:46:43,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 22:46:43,000 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 22:46:43,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 22:46:43,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 22:46:43,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 22:46:43,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 22:46:43,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 22:46:43,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 22:46:43,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 22:46:43,002 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 22:46:43,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 22:46:43,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 22:46:43,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 22:46:43,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 22:46:43,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 22:46:43,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 22:46:43,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 22:46:43,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 22:46:43,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 22:46:43,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 22:46:43,004 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 22:46:43,004 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 22:46:43,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 22:46:43,004 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 22:46:43,004 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-16 22:46:43,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 22:46:43,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 22:46:43,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 22:46:43,194 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 22:46:43,194 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 22:46:43,195 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-16 22:46:43,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5e42b11/c6eff23b62dd43b196415995344b7659/FLAG30743f5fb [2021-11-16 22:46:43,774 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 22:46:43,774 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-16 22:46:43,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5e42b11/c6eff23b62dd43b196415995344b7659/FLAG30743f5fb [2021-11-16 22:46:43,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5e42b11/c6eff23b62dd43b196415995344b7659 [2021-11-16 22:46:43,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 22:46:43,987 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 22:46:43,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 22:46:43,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 22:46:43,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 22:46:43,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:46:43" (1/1) ... [2021-11-16 22:46:43,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa2cd87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:46:43, skipping insertion in model container [2021-11-16 22:46:43,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:46:43" (1/1) ... [2021-11-16 22:46:43,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 22:46:44,077 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 22:46:44,890 WARN L230 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-16 22:46:44,914 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 22:46:44,929 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 22:46:45,192 WARN L230 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-16 22:46:45,198 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 22:46:45,295 INFO L208 MainTranslator]: Completed translation [2021-11-16 22:46:45,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:46:45 WrapperNode [2021-11-16 22:46:45,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 22:46:45,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 22:46:45,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 22:46:45,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 22:46:45,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:46:45" (1/1) ... [2021-11-16 22:46:45,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:46:45" (1/1) ... [2021-11-16 22:46:45,456 INFO L137 Inliner]: procedures = 157, calls = 812, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 2774 [2021-11-16 22:46:45,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 22:46:45,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 22:46:45,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 22:46:45,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 22:46:45,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:46:45" (1/1) ... [2021-11-16 22:46:45,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:46:45" (1/1) ... [2021-11-16 22:46:45,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:46:45" (1/1) ... [2021-11-16 22:46:45,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:46:45" (1/1) ... [2021-11-16 22:46:45,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:46:45" (1/1) ... [2021-11-16 22:46:45,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:46:45" (1/1) ... [2021-11-16 22:46:45,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:46:45" (1/1) ... [2021-11-16 22:46:45,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 22:46:45,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 22:46:45,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 22:46:45,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 22:46:45,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:46:45" (1/1) ... [2021-11-16 22:46:45,628 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 22:46:45,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 22:46:45,647 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-16 22:46:45,665 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-16 22:46:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-16 22:46:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-11-16 22:46:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-16 22:46:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-16 22:46:45,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 22:46:45,679 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2021-11-16 22:46:45,679 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2021-11-16 22:46:45,679 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2021-11-16 22:46:45,679 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2021-11-16 22:46:45,679 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2021-11-16 22:46:45,679 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2021-11-16 22:46:45,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-16 22:46:45,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-16 22:46:45,679 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2021-11-16 22:46:45,680 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2021-11-16 22:46:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-16 22:46:45,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-16 22:46:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2021-11-16 22:46:45,680 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2021-11-16 22:46:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2021-11-16 22:46:45,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2021-11-16 22:46:45,680 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2021-11-16 22:46:45,680 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2021-11-16 22:46:45,681 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-16 22:46:45,681 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-16 22:46:45,681 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2021-11-16 22:46:45,681 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2021-11-16 22:46:45,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 22:46:45,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2021-11-16 22:46:45,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2021-11-16 22:46:45,681 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2021-11-16 22:46:45,681 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2021-11-16 22:46:45,682 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2021-11-16 22:46:45,682 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2021-11-16 22:46:45,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-16 22:46:45,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-16 22:46:45,682 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2021-11-16 22:46:45,683 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2021-11-16 22:46:45,683 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2021-11-16 22:46:45,683 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2021-11-16 22:46:45,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 22:46:45,683 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2021-11-16 22:46:45,683 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2021-11-16 22:46:45,683 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2021-11-16 22:46:45,684 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2021-11-16 22:46:45,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 22:46:45,684 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2021-11-16 22:46:45,684 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2021-11-16 22:46:45,684 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2021-11-16 22:46:45,684 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2021-11-16 22:46:45,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 22:46:45,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 22:46:45,684 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-16 22:46:45,685 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2021-11-16 22:46:45,685 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2021-11-16 22:46:45,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 22:46:45,685 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2021-11-16 22:46:45,686 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2021-11-16 22:46:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2021-11-16 22:46:45,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2021-11-16 22:46:45,687 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2021-11-16 22:46:45,687 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2021-11-16 22:46:45,687 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2021-11-16 22:46:45,687 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2021-11-16 22:46:45,687 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2021-11-16 22:46:45,688 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2021-11-16 22:46:45,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 22:46:45,688 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2021-11-16 22:46:45,688 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2021-11-16 22:46:45,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 22:46:45,688 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2021-11-16 22:46:45,688 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2021-11-16 22:46:45,689 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2021-11-16 22:46:45,689 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2021-11-16 22:46:45,689 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-11-16 22:46:45,689 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-11-16 22:46:45,689 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-11-16 22:46:45,689 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-11-16 22:46:45,690 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2021-11-16 22:46:45,690 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2021-11-16 22:46:45,690 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-11-16 22:46:45,690 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-11-16 22:46:45,690 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-11-16 22:46:45,690 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-11-16 22:46:45,690 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2021-11-16 22:46:45,690 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2021-11-16 22:46:45,690 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2021-11-16 22:46:45,691 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2021-11-16 22:46:45,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 22:46:45,691 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2021-11-16 22:46:45,691 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2021-11-16 22:46:45,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2021-11-16 22:46:45,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2021-11-16 22:46:45,692 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2021-11-16 22:46:45,692 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2021-11-16 22:46:45,692 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2021-11-16 22:46:45,692 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2021-11-16 22:46:45,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-16 22:46:45,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 22:46:45,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 22:46:45,693 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2021-11-16 22:46:45,694 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2021-11-16 22:46:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2021-11-16 22:46:45,694 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2021-11-16 22:46:46,054 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 22:46:46,056 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 22:46:47,682 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 22:46:47,694 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 22:46:47,694 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-16 22:46:47,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:46:47 BoogieIcfgContainer [2021-11-16 22:46:47,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 22:46:47,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 22:46:47,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 22:46:47,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 22:46:47,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:46:43" (1/3) ... [2021-11-16 22:46:47,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c4f529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:46:47, skipping insertion in model container [2021-11-16 22:46:47,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:46:45" (2/3) ... [2021-11-16 22:46:47,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c4f529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:46:47, skipping insertion in model container [2021-11-16 22:46:47,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:46:47" (3/3) ... [2021-11-16 22:46:47,722 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-16 22:46:47,726 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 22:46:47,726 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 22:46:47,764 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 22:46:47,769 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-16 22:46:47,770 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 22:46:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 964 states, 712 states have (on average 1.4297752808988764) internal successors, (1018), 739 states have internal predecessors, (1018), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) [2021-11-16 22:46:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-16 22:46:47,808 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:46:47,809 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] [2021-11-16 22:46:47,810 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:46:47,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:46:47,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1312205542, now seen corresponding path program 1 times [2021-11-16 22:46:47,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:46:47,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778606294] [2021-11-16 22:46:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:46:47,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:46:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:48,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:46:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:48,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:48,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:46:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:48,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:46:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:48,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:48,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 22:46:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:46:48,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:46:48,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778606294] [2021-11-16 22:46:48,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778606294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:46:48,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:46:48,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:46:48,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759292876] [2021-11-16 22:46:48,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:46:48,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:46:48,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:46:48,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:46:48,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:46:48,235 INFO L87 Difference]: Start difference. First operand has 964 states, 712 states have (on average 1.4297752808988764) internal successors, (1018), 739 states have internal predecessors, (1018), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-16 22:46:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:46:49,128 INFO L93 Difference]: Finished difference Result 1942 states and 2905 transitions. [2021-11-16 22:46:49,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-16 22:46:49,130 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), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2021-11-16 22:46:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:46:49,144 INFO L225 Difference]: With dead ends: 1942 [2021-11-16 22:46:49,144 INFO L226 Difference]: Without dead ends: 943 [2021-11-16 22:46:49,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:46:49,157 INFO L933 BasicCegarLoop]: 1364 mSDtfsCounter, 1570 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-16 22:46:49,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1707 Valid, 1975 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-16 22:46:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-11-16 22:46:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 925. [2021-11-16 22:46:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 682 states have (on average 1.4193548387096775) internal successors, (968), 706 states have internal predecessors, (968), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2021-11-16 22:46:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1366 transitions. [2021-11-16 22:46:49,287 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1366 transitions. Word has length 59 [2021-11-16 22:46:49,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:46:49,287 INFO L470 AbstractCegarLoop]: Abstraction has 925 states and 1366 transitions. [2021-11-16 22:46:49,288 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), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-11-16 22:46:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1366 transitions. [2021-11-16 22:46:49,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-16 22:46:49,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:46:49,297 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] [2021-11-16 22:46:49,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 22:46:49,298 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:46:49,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:46:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1735852264, now seen corresponding path program 1 times [2021-11-16 22:46:49,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:46:49,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909180792] [2021-11-16 22:46:49,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:46:49,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:46:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:49,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:46:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:49,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:49,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:46:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:49,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:46:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:49,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 22:46:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:46:49,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:46:49,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909180792] [2021-11-16 22:46:49,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909180792] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:46:49,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:46:49,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 22:46:49,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832169063] [2021-11-16 22:46:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:46:49,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 22:46:49,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:46:49,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 22:46:49,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:46:49,445 INFO L87 Difference]: Start difference. First operand 925 states and 1366 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-16 22:46:50,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:46:50,560 INFO L93 Difference]: Finished difference Result 1851 states and 2740 transitions. [2021-11-16 22:46:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:46:50,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2021-11-16 22:46:50,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:46:50,565 INFO L225 Difference]: With dead ends: 1851 [2021-11-16 22:46:50,566 INFO L226 Difference]: Without dead ends: 943 [2021-11-16 22:46:50,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:46:50,569 INFO L933 BasicCegarLoop]: 1320 mSDtfsCounter, 367 mSDsluCounter, 2555 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 3875 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-16 22:46:50,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 3875 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-16 22:46:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-11-16 22:46:50,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 925. [2021-11-16 22:46:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 682 states have (on average 1.4178885630498534) internal successors, (967), 706 states have internal predecessors, (967), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2021-11-16 22:46:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1365 transitions. [2021-11-16 22:46:50,601 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1365 transitions. Word has length 59 [2021-11-16 22:46:50,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:46:50,601 INFO L470 AbstractCegarLoop]: Abstraction has 925 states and 1365 transitions. [2021-11-16 22:46:50,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-16 22:46:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1365 transitions. [2021-11-16 22:46:50,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-16 22:46:50,603 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:46:50,603 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] [2021-11-16 22:46:50,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-16 22:46:50,603 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:46:50,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:46:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1026212091, now seen corresponding path program 1 times [2021-11-16 22:46:50,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:46:50,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731419771] [2021-11-16 22:46:50,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:46:50,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:46:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:50,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:46:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:50,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:50,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:46:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:50,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:46:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:50,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:50,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 22:46:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:46:50,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:46:50,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731419771] [2021-11-16 22:46:50,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731419771] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:46:50,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:46:50,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 22:46:50,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455283946] [2021-11-16 22:46:50,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:46:50,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 22:46:50,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:46:50,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 22:46:50,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:46:50,729 INFO L87 Difference]: Start difference. First operand 925 states and 1365 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-16 22:46:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:46:52,055 INFO L93 Difference]: Finished difference Result 1457 states and 2226 transitions. [2021-11-16 22:46:52,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 22:46:52,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2021-11-16 22:46:52,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:46:52,062 INFO L225 Difference]: With dead ends: 1457 [2021-11-16 22:46:52,063 INFO L226 Difference]: Without dead ends: 1455 [2021-11-16 22:46:52,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:46:52,064 INFO L933 BasicCegarLoop]: 2127 mSDtfsCounter, 1291 mSDsluCounter, 3536 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 5663 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-16 22:46:52,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1375 Valid, 5663 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-16 22:46:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2021-11-16 22:46:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 927. [2021-11-16 22:46:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 684 states have (on average 1.4166666666666667) internal successors, (969), 708 states have internal predecessors, (969), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2021-11-16 22:46:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1367 transitions. [2021-11-16 22:46:52,110 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1367 transitions. Word has length 62 [2021-11-16 22:46:52,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:46:52,112 INFO L470 AbstractCegarLoop]: Abstraction has 927 states and 1367 transitions. [2021-11-16 22:46:52,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-16 22:46:52,112 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1367 transitions. [2021-11-16 22:46:52,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-16 22:46:52,114 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:46:52,114 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] [2021-11-16 22:46:52,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-16 22:46:52,115 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:46:52,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:46:52,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1878108753, now seen corresponding path program 1 times [2021-11-16 22:46:52,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:46:52,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10943141] [2021-11-16 22:46:52,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:46:52,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:46:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:52,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:46:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:52,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:52,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:46:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:52,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:46:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:52,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:52,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 22:46:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:52,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-16 22:46:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:46:52,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:46:52,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10943141] [2021-11-16 22:46:52,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10943141] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:46:52,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:46:52,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 22:46:52,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195139019] [2021-11-16 22:46:52,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:46:52,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 22:46:52,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:46:52,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 22:46:52,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:46:52,278 INFO L87 Difference]: Start difference. First operand 927 states and 1367 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-16 22:46:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:46:53,951 INFO L93 Difference]: Finished difference Result 2367 states and 3571 transitions. [2021-11-16 22:46:53,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:46:53,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2021-11-16 22:46:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:46:53,958 INFO L225 Difference]: With dead ends: 2367 [2021-11-16 22:46:53,958 INFO L226 Difference]: Without dead ends: 1459 [2021-11-16 22:46:53,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:46:53,961 INFO L933 BasicCegarLoop]: 1812 mSDtfsCounter, 2180 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2452 SdHoareTripleChecker+Valid, 3402 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-16 22:46:53,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2452 Valid, 3402 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-16 22:46:53,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2021-11-16 22:46:53,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 928. [2021-11-16 22:46:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 685 states have (on average 1.416058394160584) internal successors, (970), 709 states have internal predecessors, (970), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2021-11-16 22:46:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1368 transitions. [2021-11-16 22:46:53,997 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1368 transitions. Word has length 72 [2021-11-16 22:46:53,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:46:53,998 INFO L470 AbstractCegarLoop]: Abstraction has 928 states and 1368 transitions. [2021-11-16 22:46:53,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-16 22:46:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1368 transitions. [2021-11-16 22:46:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-16 22:46:54,000 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:46:54,001 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] [2021-11-16 22:46:54,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-16 22:46:54,001 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:46:54,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:46:54,001 INFO L85 PathProgramCache]: Analyzing trace with hash 45860082, now seen corresponding path program 1 times [2021-11-16 22:46:54,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:46:54,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829589182] [2021-11-16 22:46:54,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:46:54,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:46:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:54,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:46:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:54,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:54,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:46:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:54,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:46:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:54,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:54,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 22:46:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:54,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 22:46:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:46:54,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:46:54,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829589182] [2021-11-16 22:46:54,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829589182] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:46:54,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:46:54,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 22:46:54,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482949806] [2021-11-16 22:46:54,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:46:54,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 22:46:54,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:46:54,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 22:46:54,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:46:54,114 INFO L87 Difference]: Start difference. First operand 928 states and 1368 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-16 22:46:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:46:56,210 INFO L93 Difference]: Finished difference Result 2238 states and 3479 transitions. [2021-11-16 22:46:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 22:46:56,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2021-11-16 22:46:56,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:46:56,225 INFO L225 Difference]: With dead ends: 2238 [2021-11-16 22:46:56,225 INFO L226 Difference]: Without dead ends: 2236 [2021-11-16 22:46:56,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-16 22:46:56,233 INFO L933 BasicCegarLoop]: 2532 mSDtfsCounter, 2700 mSDsluCounter, 6326 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 818 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2898 SdHoareTripleChecker+Valid, 8858 SdHoareTripleChecker+Invalid, 2624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 818 IncrementalHoareTripleChecker+Valid, 1806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-16 22:46:56,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2898 Valid, 8858 Invalid, 2624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [818 Valid, 1806 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-16 22:46:56,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2021-11-16 22:46:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 930. [2021-11-16 22:46:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 686 states have (on average 1.4154518950437318) internal successors, (971), 709 states have internal predecessors, (971), 200 states have call successors, (200), 43 states have call predecessors, (200), 43 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2021-11-16 22:46:56,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1371 transitions. [2021-11-16 22:46:56,279 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1371 transitions. Word has length 74 [2021-11-16 22:46:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:46:56,280 INFO L470 AbstractCegarLoop]: Abstraction has 930 states and 1371 transitions. [2021-11-16 22:46:56,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-16 22:46:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1371 transitions. [2021-11-16 22:46:56,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-16 22:46:56,284 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:46:56,286 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1] [2021-11-16 22:46:56,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-16 22:46:56,287 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:46:56,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:46:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2045364121, now seen corresponding path program 1 times [2021-11-16 22:46:56,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:46:56,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200529539] [2021-11-16 22:46:56,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:46:56,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:46:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:56,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:46:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:56,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:46:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:56,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:46:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:56,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 22:46:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:56,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 22:46:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:56,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-16 22:46:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:56,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:46:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:56,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:46:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:56,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-16 22:46:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-16 22:46:56,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:46:56,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200529539] [2021-11-16 22:46:56,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200529539] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:46:56,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:46:56,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:46:56,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568197996] [2021-11-16 22:46:56,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:46:56,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:46:56,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:46:56,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:46:56,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:46:56,458 INFO L87 Difference]: Start difference. First operand 930 states and 1371 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-16 22:46:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:46:57,208 INFO L93 Difference]: Finished difference Result 1888 states and 2776 transitions. [2021-11-16 22:46:57,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:46:57,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2021-11-16 22:46:57,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:46:57,213 INFO L225 Difference]: With dead ends: 1888 [2021-11-16 22:46:57,213 INFO L226 Difference]: Without dead ends: 977 [2021-11-16 22:46:57,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:46:57,216 INFO L933 BasicCegarLoop]: 1313 mSDtfsCounter, 1471 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-16 22:46:57,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1599 Valid, 1913 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-16 22:46:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-11-16 22:46:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 950. [2021-11-16 22:46:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 700 states have (on average 1.4071428571428573) internal successors, (985), 723 states have internal predecessors, (985), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2021-11-16 22:46:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1389 transitions. [2021-11-16 22:46:57,253 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1389 transitions. Word has length 104 [2021-11-16 22:46:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:46:57,253 INFO L470 AbstractCegarLoop]: Abstraction has 950 states and 1389 transitions. [2021-11-16 22:46:57,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-16 22:46:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1389 transitions. [2021-11-16 22:46:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-16 22:46:57,257 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:46:57,257 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2021-11-16 22:46:57,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-16 22:46:57,257 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:46:57,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:46:57,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1129591135, now seen corresponding path program 1 times [2021-11-16 22:46:57,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:46:57,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486614611] [2021-11-16 22:46:57,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:46:57,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:46:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:57,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:46:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:57,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:46:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:57,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:46:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:57,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:57,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 22:46:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:57,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 22:46:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:57,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 22:46:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:57,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 22:46:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:57,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 22:46:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:57,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-16 22:46:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-16 22:46:57,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:46:57,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486614611] [2021-11-16 22:46:57,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486614611] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:46:57,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:46:57,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 22:46:57,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954043781] [2021-11-16 22:46:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:46:57,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 22:46:57,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:46:57,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 22:46:57,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:46:57,380 INFO L87 Difference]: Start difference. First operand 950 states and 1389 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-16 22:46:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:46:58,905 INFO L93 Difference]: Finished difference Result 2404 states and 3606 transitions. [2021-11-16 22:46:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:46:58,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 106 [2021-11-16 22:46:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:46:58,912 INFO L225 Difference]: With dead ends: 2404 [2021-11-16 22:46:58,913 INFO L226 Difference]: Without dead ends: 1493 [2021-11-16 22:46:58,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:46:58,919 INFO L933 BasicCegarLoop]: 1906 mSDtfsCounter, 2010 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2283 SdHoareTripleChecker+Valid, 3572 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-16 22:46:58,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2283 Valid, 3572 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-16 22:46:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2021-11-16 22:46:58,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 954. [2021-11-16 22:46:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 704 states have (on average 1.40625) internal successors, (990), 727 states have internal predecessors, (990), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2021-11-16 22:46:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1394 transitions. [2021-11-16 22:46:58,963 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1394 transitions. Word has length 106 [2021-11-16 22:46:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:46:58,964 INFO L470 AbstractCegarLoop]: Abstraction has 954 states and 1394 transitions. [2021-11-16 22:46:58,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-16 22:46:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1394 transitions. [2021-11-16 22:46:58,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-16 22:46:58,967 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:46:58,967 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:46:58,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-16 22:46:58,968 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:46:58,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:46:58,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1046832022, now seen corresponding path program 1 times [2021-11-16 22:46:58,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:46:58,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572804526] [2021-11-16 22:46:58,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:46:58,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:46:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:59,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:46:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:59,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:59,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:46:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:59,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:46:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:59,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:46:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:59,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 22:46:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:59,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 22:46:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:59,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:46:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:59,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-16 22:46:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:59,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-16 22:46:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:59,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 22:46:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:46:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-16 22:46:59,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:46:59,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572804526] [2021-11-16 22:46:59,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572804526] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:46:59,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:46:59,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:46:59,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697547675] [2021-11-16 22:46:59,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:46:59,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:46:59,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:46:59,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:46:59,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:46:59,072 INFO L87 Difference]: Start difference. First operand 954 states and 1394 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 22:46:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:46:59,904 INFO L93 Difference]: Finished difference Result 1897 states and 2793 transitions. [2021-11-16 22:46:59,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-16 22:46:59,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2021-11-16 22:46:59,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:46:59,908 INFO L225 Difference]: With dead ends: 1897 [2021-11-16 22:46:59,908 INFO L226 Difference]: Without dead ends: 982 [2021-11-16 22:46:59,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:46:59,912 INFO L933 BasicCegarLoop]: 1309 mSDtfsCounter, 360 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 2874 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-16 22:46:59,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 2874 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-16 22:46:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2021-11-16 22:46:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 954. [2021-11-16 22:46:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 704 states have (on average 1.4019886363636365) internal successors, (987), 727 states have internal predecessors, (987), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2021-11-16 22:46:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1391 transitions. [2021-11-16 22:46:59,947 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1391 transitions. Word has length 109 [2021-11-16 22:46:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:46:59,947 INFO L470 AbstractCegarLoop]: Abstraction has 954 states and 1391 transitions. [2021-11-16 22:46:59,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 22:46:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1391 transitions. [2021-11-16 22:46:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-16 22:46:59,952 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:46:59,952 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:46:59,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-16 22:46:59,953 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:46:59,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:46:59,953 INFO L85 PathProgramCache]: Analyzing trace with hash 433348783, now seen corresponding path program 1 times [2021-11-16 22:46:59,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:46:59,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342004856] [2021-11-16 22:46:59,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:46:59,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:46:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:00,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:47:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:00,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:47:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:00,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:47:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:00,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:47:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:00,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:47:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:00,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 22:47:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:00,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 22:47:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:00,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 22:47:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:00,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-16 22:47:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:00,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 22:47:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:00,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-16 22:47:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-16 22:47:00,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:47:00,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342004856] [2021-11-16 22:47:00,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342004856] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 22:47:00,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973587112] [2021-11-16 22:47:00,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:00,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 22:47:00,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 22:47:00,096 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-16 22:47:00,097 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-16 22:47:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:00,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-16 22:47:00,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:47:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:47:00,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:47:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-16 22:47:00,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973587112] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 22:47:00,986 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 22:47:00,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 11 [2021-11-16 22:47:00,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502322210] [2021-11-16 22:47:00,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 22:47:00,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 22:47:00,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:47:00,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 22:47:00,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-16 22:47:00,988 INFO L87 Difference]: Start difference. First operand 954 states and 1391 transitions. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 10 states have internal predecessors, (163), 4 states have call successors, (29), 4 states have call predecessors, (29), 3 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2021-11-16 22:47:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:47:04,458 INFO L93 Difference]: Finished difference Result 3933 states and 6064 transitions. [2021-11-16 22:47:04,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 22:47:04,459 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 10 states have internal predecessors, (163), 4 states have call successors, (29), 4 states have call predecessors, (29), 3 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 112 [2021-11-16 22:47:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:47:04,470 INFO L225 Difference]: With dead ends: 3933 [2021-11-16 22:47:04,471 INFO L226 Difference]: Without dead ends: 3018 [2021-11-16 22:47:04,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-11-16 22:47:04,475 INFO L933 BasicCegarLoop]: 1862 mSDtfsCounter, 5498 mSDsluCounter, 4213 mSDsCounter, 0 mSdLazyCounter, 3860 mSolverCounterSat, 1818 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5907 SdHoareTripleChecker+Valid, 6075 SdHoareTripleChecker+Invalid, 5678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1818 IncrementalHoareTripleChecker+Valid, 3860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-11-16 22:47:04,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5907 Valid, 6075 Invalid, 5678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1818 Valid, 3860 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-11-16 22:47:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2021-11-16 22:47:04,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 961. [2021-11-16 22:47:04,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 711 states have (on average 1.40084388185654) internal successors, (996), 734 states have internal predecessors, (996), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2021-11-16 22:47:04,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1400 transitions. [2021-11-16 22:47:04,532 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1400 transitions. Word has length 112 [2021-11-16 22:47:04,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:47:04,533 INFO L470 AbstractCegarLoop]: Abstraction has 961 states and 1400 transitions. [2021-11-16 22:47:04,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 10 states have internal predecessors, (163), 4 states have call successors, (29), 4 states have call predecessors, (29), 3 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2021-11-16 22:47:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1400 transitions. [2021-11-16 22:47:04,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-16 22:47:04,536 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:47:04,536 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:47:04,561 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-16 22:47:04,741 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-16 22:47:04,741 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:47:04,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:47:04,742 INFO L85 PathProgramCache]: Analyzing trace with hash -824916650, now seen corresponding path program 1 times [2021-11-16 22:47:04,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:47:04,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275558145] [2021-11-16 22:47:04,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:04,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:47:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:04,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:47:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:04,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:47:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:04,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:47:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:04,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:47:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:04,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:47:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:04,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 22:47:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:04,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 22:47:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:04,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-16 22:47:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:04,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 22:47:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:04,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-16 22:47:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:04,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:47:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:04,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-16 22:47:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-16 22:47:04,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:47:04,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275558145] [2021-11-16 22:47:04,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275558145] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 22:47:04,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094454263] [2021-11-16 22:47:04,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:04,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 22:47:04,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 22:47:04,991 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-16 22:47:04,992 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-16 22:47:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:05,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-16 22:47:05,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:47:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-16 22:47:05,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 22:47:05,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094454263] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:47:05,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 22:47:05,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-11-16 22:47:05,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837344253] [2021-11-16 22:47:05,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:47:05,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:47:05,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:47:05,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:47:05,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-16 22:47:05,524 INFO L87 Difference]: Start difference. First operand 961 states and 1400 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-16 22:47:05,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:47:05,806 INFO L93 Difference]: Finished difference Result 2661 states and 3999 transitions. [2021-11-16 22:47:05,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-16 22:47:05,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2021-11-16 22:47:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:47:05,814 INFO L225 Difference]: With dead ends: 2661 [2021-11-16 22:47:05,814 INFO L226 Difference]: Without dead ends: 1739 [2021-11-16 22:47:05,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-11-16 22:47:05,818 INFO L933 BasicCegarLoop]: 2101 mSDtfsCounter, 1191 mSDsluCounter, 3442 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1301 SdHoareTripleChecker+Valid, 5543 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 22:47:05,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1301 Valid, 5543 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 22:47:05,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2021-11-16 22:47:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 963. [2021-11-16 22:47:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 713 states have (on average 1.399719495091164) internal successors, (998), 736 states have internal predecessors, (998), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2021-11-16 22:47:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1402 transitions. [2021-11-16 22:47:05,868 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1402 transitions. Word has length 121 [2021-11-16 22:47:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:47:05,869 INFO L470 AbstractCegarLoop]: Abstraction has 963 states and 1402 transitions. [2021-11-16 22:47:05,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-16 22:47:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1402 transitions. [2021-11-16 22:47:05,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-16 22:47:05,872 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:47:05,872 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 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-16 22:47:05,893 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-16 22:47:06,085 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,SelfDestructingSolverStorable9 [2021-11-16 22:47:06,086 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:47:06,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:47:06,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1909926563, now seen corresponding path program 1 times [2021-11-16 22:47:06,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:47:06,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054212643] [2021-11-16 22:47:06,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:06,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:47:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:06,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:47:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:06,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:47:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:06,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:47:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:06,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:47:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:06,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:47:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:06,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 22:47:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:06,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 22:47:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:06,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-16 22:47:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:06,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 22:47:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:06,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-16 22:47:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:06,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 22:47:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:06,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-16 22:47:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:06,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 22:47:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:06,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-16 22:47:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-16 22:47:06,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:47:06,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054212643] [2021-11-16 22:47:06,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054212643] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:47:06,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:47:06,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:47:06,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851496687] [2021-11-16 22:47:06,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:47:06,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:47:06,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:47:06,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:47:06,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:47:06,204 INFO L87 Difference]: Start difference. First operand 963 states and 1402 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-16 22:47:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:47:07,372 INFO L93 Difference]: Finished difference Result 2316 states and 3446 transitions. [2021-11-16 22:47:07,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-16 22:47:07,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2021-11-16 22:47:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:47:07,378 INFO L225 Difference]: With dead ends: 2316 [2021-11-16 22:47:07,378 INFO L226 Difference]: Without dead ends: 1392 [2021-11-16 22:47:07,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:47:07,382 INFO L933 BasicCegarLoop]: 1947 mSDtfsCounter, 782 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 4018 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-16 22:47:07,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [947 Valid, 4018 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-16 22:47:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2021-11-16 22:47:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 965. [2021-11-16 22:47:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 715 states have (on average 1.3986013986013985) internal successors, (1000), 738 states have internal predecessors, (1000), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2021-11-16 22:47:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1404 transitions. [2021-11-16 22:47:07,436 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1404 transitions. Word has length 130 [2021-11-16 22:47:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:47:07,436 INFO L470 AbstractCegarLoop]: Abstraction has 965 states and 1404 transitions. [2021-11-16 22:47:07,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-16 22:47:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1404 transitions. [2021-11-16 22:47:07,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-16 22:47:07,439 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:47:07,439 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 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-16 22:47:07,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-16 22:47:07,440 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:47:07,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:47:07,441 INFO L85 PathProgramCache]: Analyzing trace with hash 893640959, now seen corresponding path program 1 times [2021-11-16 22:47:07,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:47:07,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384953743] [2021-11-16 22:47:07,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:07,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:47:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:47:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:47:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:47:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:47:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:47:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 22:47:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 22:47:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-16 22:47:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 22:47:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-16 22:47:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-16 22:47:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-16 22:47:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-16 22:47:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-16 22:47:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-16 22:47:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-16 22:47:07,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:47:07,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384953743] [2021-11-16 22:47:07,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384953743] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 22:47:07,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919967594] [2021-11-16 22:47:07,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:07,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 22:47:07,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 22:47:07,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 22:47:07,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-16 22:47:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 43 conjunts are in the unsatisfiable core [2021-11-16 22:47:08,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:47:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-16 22:47:08,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 22:47:08,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919967594] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:47:08,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 22:47:08,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 10 [2021-11-16 22:47:08,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547658832] [2021-11-16 22:47:08,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:47:08,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 22:47:08,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:47:08,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 22:47:08,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-16 22:47:08,252 INFO L87 Difference]: Start difference. First operand 965 states and 1404 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 22:47:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:47:08,440 INFO L93 Difference]: Finished difference Result 1912 states and 2797 transitions. [2021-11-16 22:47:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 22:47:08,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2021-11-16 22:47:08,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:47:08,445 INFO L225 Difference]: With dead ends: 1912 [2021-11-16 22:47:08,445 INFO L226 Difference]: Without dead ends: 973 [2021-11-16 22:47:08,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 167 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-11-16 22:47:08,449 INFO L933 BasicCegarLoop]: 1362 mSDtfsCounter, 39 mSDsluCounter, 9498 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 10860 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 22:47:08,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 10860 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 22:47:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-11-16 22:47:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 967. [2021-11-16 22:47:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 716 states have (on average 1.3980446927374302) internal successors, (1001), 740 states have internal predecessors, (1001), 202 states have call successors, (202), 47 states have call predecessors, (202), 48 states have return successors, (203), 200 states have call predecessors, (203), 202 states have call successors, (203) [2021-11-16 22:47:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1406 transitions. [2021-11-16 22:47:08,492 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1406 transitions. Word has length 138 [2021-11-16 22:47:08,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:47:08,493 INFO L470 AbstractCegarLoop]: Abstraction has 967 states and 1406 transitions. [2021-11-16 22:47:08,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 22:47:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1406 transitions. [2021-11-16 22:47:08,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-16 22:47:08,497 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:47:08,497 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:47:08,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-16 22:47:08,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 22:47:08,717 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:47:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:47:08,717 INFO L85 PathProgramCache]: Analyzing trace with hash -598170049, now seen corresponding path program 1 times [2021-11-16 22:47:08,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:47:08,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316805948] [2021-11-16 22:47:08,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:08,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:47:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:47:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:47:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:47:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:47:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:47:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:47:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-16 22:47:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 22:47:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 22:47:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-16 22:47:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-16 22:47:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-16 22:47:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-16 22:47:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-16 22:47:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-16 22:47:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-16 22:47:08,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:47:08,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316805948] [2021-11-16 22:47:08,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316805948] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:47:08,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:47:08,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 22:47:08,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370210763] [2021-11-16 22:47:08,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:47:08,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 22:47:08,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:47:08,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 22:47:08,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-16 22:47:08,890 INFO L87 Difference]: Start difference. First operand 967 states and 1406 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 22:47:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:47:10,752 INFO L93 Difference]: Finished difference Result 2852 states and 4298 transitions. [2021-11-16 22:47:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 22:47:10,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2021-11-16 22:47:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:47:10,761 INFO L225 Difference]: With dead ends: 2852 [2021-11-16 22:47:10,761 INFO L226 Difference]: Without dead ends: 1926 [2021-11-16 22:47:10,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-16 22:47:10,764 INFO L933 BasicCegarLoop]: 2242 mSDtfsCounter, 1739 mSDsluCounter, 7863 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 10105 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-16 22:47:10,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1933 Valid, 10105 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-16 22:47:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2021-11-16 22:47:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 972. [2021-11-16 22:47:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 720 states have (on average 1.3958333333333333) internal successors, (1005), 744 states have internal predecessors, (1005), 202 states have call successors, (202), 47 states have call predecessors, (202), 49 states have return successors, (207), 201 states have call predecessors, (207), 202 states have call successors, (207) [2021-11-16 22:47:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1414 transitions. [2021-11-16 22:47:10,816 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1414 transitions. Word has length 141 [2021-11-16 22:47:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:47:10,816 INFO L470 AbstractCegarLoop]: Abstraction has 972 states and 1414 transitions. [2021-11-16 22:47:10,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-16 22:47:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1414 transitions. [2021-11-16 22:47:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-16 22:47:10,819 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:47:10,819 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-16 22:47:10,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-16 22:47:10,820 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:47:10,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:47:10,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1479322347, now seen corresponding path program 2 times [2021-11-16 22:47:10,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:47:10,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223661390] [2021-11-16 22:47:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:47:10,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:47:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:11,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:47:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:11,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:47:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:11,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:47:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:11,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:47:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:11,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:47:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:11,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:47:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:11,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-16 22:47:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:11,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 22:47:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:11,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 22:47:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:11,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-16 22:47:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:11,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-16 22:47:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:11,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-16 22:47:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:11,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-16 22:47:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:11,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-16 22:47:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:12,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-16 22:47:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:47:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-16 22:47:12,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:47:12,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223661390] [2021-11-16 22:47:12,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223661390] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 22:47:12,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510751367] [2021-11-16 22:47:12,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 22:47:12,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 22:47:12,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 22:47:12,010 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 22:47:12,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-16 22:47:42,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 22:47:42,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 22:47:42,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 121 conjunts are in the unsatisfiable core [2021-11-16 22:47:42,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:47:42,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-16 22:47:42,719 INFO L354 Elim1Store]: treesize reduction 180, result has 13.9 percent of original size [2021-11-16 22:47:42,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 41 treesize of output 53 [2021-11-16 22:47:43,247 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-11-16 22:47:43,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 28 [2021-11-16 22:47:43,426 INFO L354 Elim1Store]: treesize reduction 68, result has 16.0 percent of original size [2021-11-16 22:47:43,426 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 43 treesize of output 45 [2021-11-16 22:47:43,541 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-16 22:47:43,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:43,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:43,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:43,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-11-16 22:47:43,899 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-16 22:47:43,904 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-16 22:47:44,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,009 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-16 22:47:44,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,018 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-16 22:47:44,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-16 22:47:44,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2021-11-16 22:47:44,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,433 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 42 treesize of output 26 [2021-11-16 22:47:44,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,439 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 23 treesize of output 22 [2021-11-16 22:47:44,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,456 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 42 treesize of output 26 [2021-11-16 22:47:44,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:44,462 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 23 treesize of output 22 [2021-11-16 22:47:45,566 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-11-16 22:47:45,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 693 treesize of output 566 [2021-11-16 22:47:45,926 INFO L354 Elim1Store]: treesize reduction 328, result has 14.4 percent of original size [2021-11-16 22:47:45,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 674 treesize of output 566 [2021-11-16 22:47:46,311 INFO L354 Elim1Store]: treesize reduction 500, result has 10.4 percent of original size [2021-11-16 22:47:46,311 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 486 treesize of output 375 [2021-11-16 22:47:46,385 INFO L354 Elim1Store]: treesize reduction 316, result has 10.5 percent of original size [2021-11-16 22:47:46,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 251 treesize of output 229 [2021-11-16 22:47:46,393 INFO L354 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2021-11-16 22:47:46,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 226 treesize of output 166 [2021-11-16 22:47:46,458 INFO L354 Elim1Store]: treesize reduction 376, result has 13.0 percent of original size [2021-11-16 22:47:46,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 178 treesize of output 178 [2021-11-16 22:47:47,051 INFO L354 Elim1Store]: treesize reduction 376, result has 12.6 percent of original size [2021-11-16 22:47:47,051 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 267 treesize of output 262 [2021-11-16 22:47:47,129 INFO L354 Elim1Store]: treesize reduction 374, result has 13.0 percent of original size [2021-11-16 22:47:47,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 262 treesize of output 258 [2021-11-16 22:47:47,206 INFO L354 Elim1Store]: treesize reduction 406, result has 12.1 percent of original size [2021-11-16 22:47:47,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 243 treesize of output 239 [2021-11-16 22:47:47,277 INFO L354 Elim1Store]: treesize reduction 386, result has 10.2 percent of original size [2021-11-16 22:47:47,280 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 224 treesize of output 197 [2021-11-16 22:47:48,110 INFO L354 Elim1Store]: treesize reduction 278, result has 15.2 percent of original size [2021-11-16 22:47:48,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 133 treesize of output 144 [2021-11-16 22:47:48,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:48,167 INFO L354 Elim1Store]: treesize reduction 200, result has 15.6 percent of original size [2021-11-16 22:47:48,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 110 [2021-11-16 22:47:48,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:48,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:48,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:48,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:48,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:48,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:48,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:48,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:48,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:48,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:48,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:48,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2021-11-16 22:47:49,119 INFO L354 Elim1Store]: treesize reduction 396, result has 13.0 percent of original size [2021-11-16 22:47:49,120 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 139 treesize of output 153 [2021-11-16 22:47:49,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:49,155 INFO L354 Elim1Store]: treesize reduction 200, result has 15.6 percent of original size [2021-11-16 22:47:49,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 135 treesize of output 125 [2021-11-16 22:47:49,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:49,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:49,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:49,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:49,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:49,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:49,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:49,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:49,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:49,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:49,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:47:49,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2021-11-16 22:48:10,955 INFO L354 Elim1Store]: treesize reduction 496, result has 12.4 percent of original size [2021-11-16 22:48:10,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 635 treesize of output 478 [2021-11-16 22:48:11,017 INFO L354 Elim1Store]: treesize reduction 272, result has 12.3 percent of original size [2021-11-16 22:48:11,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 739 treesize of output 438 [2021-11-16 22:48:11,051 INFO L354 Elim1Store]: treesize reduction 186, result has 1.6 percent of original size [2021-11-16 22:48:11,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 557 treesize of output 291 [2021-11-16 22:48:11,063 INFO L354 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2021-11-16 22:48:11,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 259 treesize of output 182 [2021-11-16 22:48:11,131 INFO L354 Elim1Store]: treesize reduction 194, result has 26.8 percent of original size [2021-11-16 22:48:11,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 221 treesize of output 227 [2021-11-16 22:48:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-16 22:48:11,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:48:19,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510751367] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 22:48:19,486 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 22:48:19,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 39] total 59 [2021-11-16 22:48:19,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989276643] [2021-11-16 22:48:19,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 22:48:19,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2021-11-16 22:48:19,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:48:19,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-11-16 22:48:19,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3349, Unknown=7, NotChecked=0, Total=3540 [2021-11-16 22:48:19,488 INFO L87 Difference]: Start difference. First operand 972 states and 1414 transitions. Second operand has 59 states, 56 states have (on average 2.982142857142857) internal successors, (167), 50 states have internal predecessors, (167), 16 states have call successors, (29), 9 states have call predecessors, (29), 12 states have return successors, (25), 18 states have call predecessors, (25), 16 states have call successors, (25) [2021-11-16 22:48:56,655 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:48:58,682 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-16 22:49:00,437 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:02,290 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-16 22:49:11,834 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:13,946 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:17,019 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:22,633 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-16 22:49:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:49:42,700 INFO L93 Difference]: Finished difference Result 6040 states and 9435 transitions. [2021-11-16 22:49:42,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-11-16 22:49:42,701 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 56 states have (on average 2.982142857142857) internal successors, (167), 50 states have internal predecessors, (167), 16 states have call successors, (29), 9 states have call predecessors, (29), 12 states have return successors, (25), 18 states have call predecessors, (25), 16 states have call successors, (25) Word has length 144 [2021-11-16 22:49:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:49:42,724 INFO L225 Difference]: With dead ends: 6040 [2021-11-16 22:49:42,725 INFO L226 Difference]: Without dead ends: 6038 [2021-11-16 22:49:42,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 151 SyntacticMatches, 17 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3545 ImplicationChecksByTransitivity, 62.0s TimeCoverageRelationStatistics Valid=670, Invalid=11974, Unknown=12, NotChecked=0, Total=12656 [2021-11-16 22:49:42,729 INFO L933 BasicCegarLoop]: 3753 mSDtfsCounter, 9712 mSDsluCounter, 87661 mSDsCounter, 0 mSdLazyCounter, 55066 mSolverCounterSat, 5648 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10090 SdHoareTripleChecker+Valid, 91414 SdHoareTripleChecker+Invalid, 70220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 5648 IncrementalHoareTripleChecker+Valid, 55066 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 9504 IncrementalHoareTripleChecker+Unchecked, 50.8s IncrementalHoareTripleChecker+Time [2021-11-16 22:49:42,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10090 Valid, 91414 Invalid, 70220 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [5648 Valid, 55066 Invalid, 2 Unknown, 9504 Unchecked, 50.8s Time] [2021-11-16 22:49:42,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2021-11-16 22:49:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 1760. [2021-11-16 22:49:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1299 states have (on average 1.3933795227097767) internal successors, (1810), 1344 states have internal predecessors, (1810), 367 states have call successors, (367), 91 states have call predecessors, (367), 93 states have return successors, (373), 359 states have call predecessors, (373), 367 states have call successors, (373) [2021-11-16 22:49:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2550 transitions. [2021-11-16 22:49:42,893 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2550 transitions. Word has length 144 [2021-11-16 22:49:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:49:42,894 INFO L470 AbstractCegarLoop]: Abstraction has 1760 states and 2550 transitions. [2021-11-16 22:49:42,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 56 states have (on average 2.982142857142857) internal successors, (167), 50 states have internal predecessors, (167), 16 states have call successors, (29), 9 states have call predecessors, (29), 12 states have return successors, (25), 18 states have call predecessors, (25), 16 states have call successors, (25) [2021-11-16 22:49:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2550 transitions. [2021-11-16 22:49:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-16 22:49:42,901 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:49:42,901 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:49:42,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-16 22:49:43,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 22:49:43,115 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:49:43,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:49:43,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1730285614, now seen corresponding path program 1 times [2021-11-16 22:49:43,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:49:43,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677051996] [2021-11-16 22:49:43,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:49:43,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:49:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:49:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:49:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:49:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:49:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:49:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-16 22:49:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 22:49:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-16 22:49:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 22:49:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-16 22:49:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 22:49:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-16 22:49:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 22:49:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-16 22:49:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-16 22:49:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-16 22:49:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-16 22:49:43,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:49:43,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677051996] [2021-11-16 22:49:43,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677051996] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:49:43,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:49:43,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 22:49:43,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169193341] [2021-11-16 22:49:43,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:49:43,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 22:49:43,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:49:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 22:49:43,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-16 22:49:43,264 INFO L87 Difference]: Start difference. First operand 1760 states and 2550 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-16 22:49:44,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:49:44,487 INFO L93 Difference]: Finished difference Result 2728 states and 3970 transitions. [2021-11-16 22:49:44,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 22:49:44,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 148 [2021-11-16 22:49:44,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:49:44,493 INFO L225 Difference]: With dead ends: 2728 [2021-11-16 22:49:44,493 INFO L226 Difference]: Without dead ends: 1793 [2021-11-16 22:49:44,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-16 22:49:44,496 INFO L933 BasicCegarLoop]: 1314 mSDtfsCounter, 729 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 4888 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-16 22:49:44,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [779 Valid, 4888 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-16 22:49:44,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2021-11-16 22:49:44,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1756. [2021-11-16 22:49:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1296 states have (on average 1.3935185185185186) internal successors, (1806), 1341 states have internal predecessors, (1806), 366 states have call successors, (366), 91 states have call predecessors, (366), 93 states have return successors, (372), 358 states have call predecessors, (372), 366 states have call successors, (372) [2021-11-16 22:49:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2544 transitions. [2021-11-16 22:49:44,590 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2544 transitions. Word has length 148 [2021-11-16 22:49:44,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:49:44,591 INFO L470 AbstractCegarLoop]: Abstraction has 1756 states and 2544 transitions. [2021-11-16 22:49:44,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-16 22:49:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2544 transitions. [2021-11-16 22:49:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-16 22:49:44,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:49:44,596 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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-16 22:49:44,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-16 22:49:44,596 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:49:44,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:49:44,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1005507498, now seen corresponding path program 1 times [2021-11-16 22:49:44,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:49:44,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569159530] [2021-11-16 22:49:44,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:49:44,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:49:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:44,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:49:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:44,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:49:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:44,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:49:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:44,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:49:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:44,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:49:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:45,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:49:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:45,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-16 22:49:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:45,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-16 22:49:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:45,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 22:49:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:45,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-16 22:49:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:45,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 22:49:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:45,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-16 22:49:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:45,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-16 22:49:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:45,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-11-16 22:49:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:45,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-16 22:49:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:45,034 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-16 22:49:45,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:49:45,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569159530] [2021-11-16 22:49:45,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569159530] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 22:49:45,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113437624] [2021-11-16 22:49:45,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:49:45,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 22:49:45,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 22:49:45,036 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 22:49:45,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-16 22:49:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:49:45,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-16 22:49:45,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:49:45,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2021-11-16 22:49:45,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-11-16 22:49:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 22:49:46,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 22:49:46,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113437624] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:49:46,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 22:49:46,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 17 [2021-11-16 22:49:46,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909012214] [2021-11-16 22:49:46,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:49:46,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-16 22:49:46,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:49:46,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-16 22:49:46,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-11-16 22:49:46,003 INFO L87 Difference]: Start difference. First operand 1756 states and 2544 transitions. Second operand has 15 states, 15 states have (on average 7.6) internal successors, (114), 13 states have internal predecessors, (114), 4 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-16 22:49:52,026 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:49:53,528 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-16 22:49:55,232 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-16 22:49:57,721 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-16 22:50:01,917 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:50:03,510 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-16 22:50:06,032 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:50:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:50:17,908 INFO L93 Difference]: Finished difference Result 9233 states and 14189 transitions. [2021-11-16 22:50:17,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-16 22:50:17,909 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.6) internal successors, (114), 13 states have internal predecessors, (114), 4 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 147 [2021-11-16 22:50:17,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:50:17,928 INFO L225 Difference]: With dead ends: 9233 [2021-11-16 22:50:17,929 INFO L226 Difference]: Without dead ends: 7517 [2021-11-16 22:50:17,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 174 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=1698, Unknown=0, NotChecked=0, Total=1980 [2021-11-16 22:50:17,936 INFO L933 BasicCegarLoop]: 2492 mSDtfsCounter, 7597 mSDsluCounter, 24949 mSDsCounter, 0 mSdLazyCounter, 15484 mSolverCounterSat, 3785 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7602 SdHoareTripleChecker+Valid, 27441 SdHoareTripleChecker+Invalid, 19270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3785 IncrementalHoareTripleChecker+Valid, 15484 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.5s IncrementalHoareTripleChecker+Time [2021-11-16 22:50:17,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7602 Valid, 27441 Invalid, 19270 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3785 Valid, 15484 Invalid, 1 Unknown, 0 Unchecked, 30.5s Time] [2021-11-16 22:50:17,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7517 states. [2021-11-16 22:50:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7517 to 2970. [2021-11-16 22:50:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2970 states, 2198 states have (on average 1.4071883530482256) internal successors, (3093), 2273 states have internal predecessors, (3093), 606 states have call successors, (606), 162 states have call predecessors, (606), 165 states have return successors, (635), 580 states have call predecessors, (635), 606 states have call successors, (635) [2021-11-16 22:50:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2970 states and 4334 transitions. [2021-11-16 22:50:18,223 INFO L78 Accepts]: Start accepts. Automaton has 2970 states and 4334 transitions. Word has length 147 [2021-11-16 22:50:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:50:18,223 INFO L470 AbstractCegarLoop]: Abstraction has 2970 states and 4334 transitions. [2021-11-16 22:50:18,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.6) internal successors, (114), 13 states have internal predecessors, (114), 4 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-16 22:50:18,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2970 states and 4334 transitions. [2021-11-16 22:50:18,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-16 22:50:18,232 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:50:18,233 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:50:18,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-16 22:50:18,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-16 22:50:18,454 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:50:18,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:50:18,454 INFO L85 PathProgramCache]: Analyzing trace with hash -266957202, now seen corresponding path program 1 times [2021-11-16 22:50:18,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:50:18,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070612466] [2021-11-16 22:50:18,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:50:18,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:50:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:50:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:50:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:50:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:50:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:50:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:50:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-16 22:50:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 22:50:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 22:50:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-16 22:50:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-16 22:50:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-16 22:50:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-16 22:50:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-16 22:50:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-16 22:50:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-16 22:50:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-16 22:50:19,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:50:19,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070612466] [2021-11-16 22:50:19,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070612466] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 22:50:19,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123828219] [2021-11-16 22:50:19,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:50:19,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 22:50:19,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 22:50:19,601 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 22:50:19,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-16 22:50:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:50:19,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 118 conjunts are in the unsatisfiable core [2021-11-16 22:50:19,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:50:20,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-16 22:50:20,304 INFO L354 Elim1Store]: treesize reduction 164, result has 11.4 percent of original size [2021-11-16 22:50:20,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 33 treesize of output 41 [2021-11-16 22:50:20,530 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-16 22:50:20,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 10 [2021-11-16 22:50:20,627 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-16 22:50:20,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 19 [2021-11-16 22:50:20,747 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-16 22:50:21,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-11-16 22:50:21,053 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-16 22:50:21,061 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-16 22:50:21,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-16 22:50:21,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,190 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-16 22:50:21,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,199 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-16 22:50:21,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,585 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 42 treesize of output 26 [2021-11-16 22:50:21,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,590 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 23 treesize of output 22 [2021-11-16 22:50:21,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2021-11-16 22:50:21,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:21,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2021-11-16 22:50:22,356 INFO L354 Elim1Store]: treesize reduction 316, result has 10.5 percent of original size [2021-11-16 22:50:22,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 252 treesize of output 230 [2021-11-16 22:50:22,455 INFO L354 Elim1Store]: treesize reduction 316, result has 10.5 percent of original size [2021-11-16 22:50:22,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 218 treesize of output 184 [2021-11-16 22:50:22,538 INFO L354 Elim1Store]: treesize reduction 480, result has 10.4 percent of original size [2021-11-16 22:50:22,538 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 185 treesize of output 182 [2021-11-16 22:50:22,595 INFO L354 Elim1Store]: treesize reduction 362, result has 13.0 percent of original size [2021-11-16 22:50:22,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 170 treesize of output 170 [2021-11-16 22:50:23,183 INFO L354 Elim1Store]: treesize reduction 410, result has 9.7 percent of original size [2021-11-16 22:50:23,183 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 5 new quantified variables, introduced 11 case distinctions, treesize of input 315 treesize of output 243 [2021-11-16 22:50:23,328 INFO L354 Elim1Store]: treesize reduction 496, result has 11.7 percent of original size [2021-11-16 22:50:23,329 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 300 treesize of output 287 [2021-11-16 22:50:23,435 INFO L354 Elim1Store]: treesize reduction 808, result has 9.3 percent of original size [2021-11-16 22:50:23,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 296 treesize of output 281 [2021-11-16 22:50:26,702 INFO L354 Elim1Store]: treesize reduction 444, result has 10.7 percent of original size [2021-11-16 22:50:26,702 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 7 new quantified variables, introduced 21 case distinctions, treesize of input 308 treesize of output 238 [2021-11-16 22:50:26,788 INFO L354 Elim1Store]: treesize reduction 408, result has 11.5 percent of original size [2021-11-16 22:50:26,788 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 217 treesize of output 204 [2021-11-16 22:50:26,838 INFO L354 Elim1Store]: treesize reduction 278, result has 15.2 percent of original size [2021-11-16 22:50:26,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 198 treesize of output 209 [2021-11-16 22:50:27,912 INFO L354 Elim1Store]: treesize reduction 396, result has 13.0 percent of original size [2021-11-16 22:50:27,912 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 139 treesize of output 153 [2021-11-16 22:50:27,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:27,947 INFO L354 Elim1Store]: treesize reduction 200, result has 15.6 percent of original size [2021-11-16 22:50:27,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 135 treesize of output 125 [2021-11-16 22:50:27,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:27,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:27,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:27,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:27,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:27,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:27,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:27,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:27,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:27,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:27,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:27,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2021-11-16 22:50:46,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,962 INFO L354 Elim1Store]: treesize reduction 200, result has 15.6 percent of original size [2021-11-16 22:50:46,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 61 [2021-11-16 22:50:46,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:46,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:47,058 INFO L354 Elim1Store]: treesize reduction 302, result has 10.4 percent of original size [2021-11-16 22:50:47,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 160 treesize of output 190 [2021-11-16 22:50:47,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:47,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:47,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:47,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:47,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:47,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:47,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:47,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:47,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:47,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:47,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:50:47,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 135 [2021-11-16 22:50:48,259 INFO L354 Elim1Store]: treesize reduction 496, result has 12.4 percent of original size [2021-11-16 22:50:48,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 608 treesize of output 457 [2021-11-16 22:50:48,271 INFO L354 Elim1Store]: treesize reduction 232, result has 0.4 percent of original size [2021-11-16 22:50:48,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 589 treesize of output 340 [2021-11-16 22:50:48,334 INFO L354 Elim1Store]: treesize reduction 272, result has 12.3 percent of original size [2021-11-16 22:50:48,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 325 treesize of output 237 [2021-11-16 22:50:48,343 INFO L354 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2021-11-16 22:50:48,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 244 treesize of output 167 [2021-11-16 22:50:48,350 INFO L354 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2021-11-16 22:50:48,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 206 treesize of output 154 [2021-11-16 22:50:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-16 22:50:48,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:50:53,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123828219] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 22:50:53,490 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 22:50:53,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 39] total 60 [2021-11-16 22:50:53,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140772840] [2021-11-16 22:50:53,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 22:50:53,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-11-16 22:50:53,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:50:53,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-11-16 22:50:53,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3575, Unknown=8, NotChecked=0, Total=3782 [2021-11-16 22:50:53,495 INFO L87 Difference]: Start difference. First operand 2970 states and 4334 transitions. Second operand has 60 states, 57 states have (on average 3.0) internal successors, (171), 51 states have internal predecessors, (171), 18 states have call successors, (31), 9 states have call predecessors, (31), 12 states have return successors, (27), 20 states have call predecessors, (27), 18 states have call successors, (27) [2021-11-16 22:51:43,655 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-16 22:51:45,684 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-16 22:51:47,988 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-16 22:51:54,327 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:51:59,531 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-16 22:52:06,002 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-16 22:52:07,160 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:52:10,166 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-16 22:52:12,191 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-16 22:52:17,407 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-16 22:52:20,264 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-16 22:52:25,032 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:52:26,880 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 22:52:52,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:52:52,047 INFO L93 Difference]: Finished difference Result 10285 states and 16258 transitions. [2021-11-16 22:52:52,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-11-16 22:52:52,048 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 57 states have (on average 3.0) internal successors, (171), 51 states have internal predecessors, (171), 18 states have call successors, (31), 9 states have call predecessors, (31), 12 states have return successors, (27), 20 states have call predecessors, (27), 18 states have call successors, (27) Word has length 148 [2021-11-16 22:52:52,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:52:52,077 INFO L225 Difference]: With dead ends: 10285 [2021-11-16 22:52:52,078 INFO L226 Difference]: Without dead ends: 10283 [2021-11-16 22:52:52,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 152 SyntacticMatches, 19 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 3860 ImplicationChecksByTransitivity, 68.8s TimeCoverageRelationStatistics Valid=724, Invalid=12831, Unknown=17, NotChecked=0, Total=13572 [2021-11-16 22:52:52,085 INFO L933 BasicCegarLoop]: 4689 mSDtfsCounter, 11161 mSDsluCounter, 125955 mSDsCounter, 0 mSdLazyCounter, 76868 mSolverCounterSat, 6311 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11543 SdHoareTripleChecker+Valid, 130644 SdHoareTripleChecker+Invalid, 99708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.4s SdHoareTripleChecker+Time, 6311 IncrementalHoareTripleChecker+Valid, 76868 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 16523 IncrementalHoareTripleChecker+Unchecked, 75.7s IncrementalHoareTripleChecker+Time [2021-11-16 22:52:52,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11543 Valid, 130644 Invalid, 99708 Unknown, 0 Unchecked, 0.4s Time], IncrementalHoareTripleChecker [6311 Valid, 76868 Invalid, 6 Unknown, 16523 Unchecked, 75.7s Time] [2021-11-16 22:52:52,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10283 states. [2021-11-16 22:52:52,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10283 to 2993. [2021-11-16 22:52:52,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2993 states, 2213 states have (on average 1.4062358788974243) internal successors, (3112), 2291 states have internal predecessors, (3112), 611 states have call successors, (611), 164 states have call predecessors, (611), 168 states have return successors, (641), 585 states have call predecessors, (641), 611 states have call successors, (641) [2021-11-16 22:52:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 4364 transitions. [2021-11-16 22:52:52,427 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 4364 transitions. Word has length 148 [2021-11-16 22:52:52,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:52:52,427 INFO L470 AbstractCegarLoop]: Abstraction has 2993 states and 4364 transitions. [2021-11-16 22:52:52,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 57 states have (on average 3.0) internal successors, (171), 51 states have internal predecessors, (171), 18 states have call successors, (31), 9 states have call predecessors, (31), 12 states have return successors, (27), 20 states have call predecessors, (27), 18 states have call successors, (27) [2021-11-16 22:52:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4364 transitions. [2021-11-16 22:52:52,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-16 22:52:52,436 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:52:52,436 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:52:52,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-16 22:52:52,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-16 22:52:52,655 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:52:52,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:52:52,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1498835704, now seen corresponding path program 1 times [2021-11-16 22:52:52,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:52:52,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048465617] [2021-11-16 22:52:52,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:52:52,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:52:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:52:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:52:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:52:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:52:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:52:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:52:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-16 22:52:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 22:52:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 22:52:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-16 22:52:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-16 22:52:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-16 22:52:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-16 22:52:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-16 22:52:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-16 22:52:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-16 22:52:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-16 22:52:52,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:52:52,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048465617] [2021-11-16 22:52:52,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048465617] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 22:52:52,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:52:52,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 22:52:52,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660647304] [2021-11-16 22:52:52,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 22:52:52,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:52:52,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:52:52,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:52:52,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:52:52,765 INFO L87 Difference]: Start difference. First operand 2993 states and 4364 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-16 22:52:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:52:53,758 INFO L93 Difference]: Finished difference Result 5966 states and 8750 transitions. [2021-11-16 22:52:53,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-16 22:52:53,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 150 [2021-11-16 22:52:53,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:52:53,770 INFO L225 Difference]: With dead ends: 5966 [2021-11-16 22:52:53,771 INFO L226 Difference]: Without dead ends: 3013 [2021-11-16 22:52:53,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 22:52:53,778 INFO L933 BasicCegarLoop]: 1305 mSDtfsCounter, 362 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-16 22:52:53,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 2866 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-16 22:52:53,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2021-11-16 22:52:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 2966. [2021-11-16 22:52:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2966 states, 2190 states have (on average 1.404109589041096) internal successors, (3075), 2267 states have internal predecessors, (3075), 609 states have call successors, (609), 163 states have call predecessors, (609), 166 states have return successors, (638), 582 states have call predecessors, (638), 609 states have call successors, (638) [2021-11-16 22:52:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 4322 transitions. [2021-11-16 22:52:54,029 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 4322 transitions. Word has length 150 [2021-11-16 22:52:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:52:54,030 INFO L470 AbstractCegarLoop]: Abstraction has 2966 states and 4322 transitions. [2021-11-16 22:52:54,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-16 22:52:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 4322 transitions. [2021-11-16 22:52:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-16 22:52:54,039 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:52:54,040 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:52:54,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-16 22:52:54,040 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:52:54,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:52:54,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1652669184, now seen corresponding path program 1 times [2021-11-16 22:52:54,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:52:54,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475576212] [2021-11-16 22:52:54,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:52:54,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:52:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 22:52:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:52:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 22:52:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 22:52:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 22:52:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 22:52:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 22:52:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-16 22:52:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-16 22:52:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-16 22:52:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-16 22:52:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-16 22:52:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-16 22:52:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-16 22:52:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-16 22:52:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-16 22:52:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-16 22:52:54,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 22:52:54,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475576212] [2021-11-16 22:52:54,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475576212] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 22:52:54,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111937762] [2021-11-16 22:52:54,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:52:54,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 22:52:54,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 22:52:54,186 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 22:52:54,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-16 22:52:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:52:54,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-16 22:52:54,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:52:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-16 22:52:54,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:52:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-16 22:52:55,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111937762] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 22:52:55,050 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 22:52:55,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 11 [2021-11-16 22:52:55,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293673863] [2021-11-16 22:52:55,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 22:52:55,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 22:52:55,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 22:52:55,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 22:52:55,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-16 22:52:55,052 INFO L87 Difference]: Start difference. First operand 2966 states and 4322 transitions. Second operand has 11 states, 11 states have (on average 18.181818181818183) internal successors, (200), 10 states have internal predecessors, (200), 7 states have call successors, (40), 4 states have call predecessors, (40), 3 states have return successors, (37), 7 states have call predecessors, (37), 7 states have call successors, (37) [2021-11-16 22:52:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:52:59,523 INFO L93 Difference]: Finished difference Result 9660 states and 14641 transitions. [2021-11-16 22:52:59,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 22:52:59,524 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.181818181818183) internal successors, (200), 10 states have internal predecessors, (200), 7 states have call successors, (40), 4 states have call predecessors, (40), 3 states have return successors, (37), 7 states have call predecessors, (37), 7 states have call successors, (37) Word has length 156 [2021-11-16 22:52:59,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:52:59,543 INFO L225 Difference]: With dead ends: 9660 [2021-11-16 22:52:59,543 INFO L226 Difference]: Without dead ends: 6734 [2021-11-16 22:52:59,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-11-16 22:52:59,551 INFO L933 BasicCegarLoop]: 1784 mSDtfsCounter, 5170 mSDsluCounter, 5152 mSDsCounter, 0 mSdLazyCounter, 5895 mSolverCounterSat, 1573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5584 SdHoareTripleChecker+Valid, 6936 SdHoareTripleChecker+Invalid, 7468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1573 IncrementalHoareTripleChecker+Valid, 5895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-16 22:52:59,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5584 Valid, 6936 Invalid, 7468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1573 Valid, 5895 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2021-11-16 22:52:59,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6734 states. [2021-11-16 22:52:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6734 to 3022. [2021-11-16 22:52:59,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 2240 states have (on average 1.4049107142857142) internal successors, (3147), 2317 states have internal predecessors, (3147), 615 states have call successors, (615), 163 states have call predecessors, (615), 166 states have return successors, (644), 588 states have call predecessors, (644), 615 states have call successors, (644) [2021-11-16 22:52:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4406 transitions. [2021-11-16 22:52:59,837 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4406 transitions. Word has length 156 [2021-11-16 22:52:59,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:52:59,837 INFO L470 AbstractCegarLoop]: Abstraction has 3022 states and 4406 transitions. [2021-11-16 22:52:59,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.181818181818183) internal successors, (200), 10 states have internal predecessors, (200), 7 states have call successors, (40), 4 states have call predecessors, (40), 3 states have return successors, (37), 7 states have call predecessors, (37), 7 states have call successors, (37) [2021-11-16 22:52:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4406 transitions. [2021-11-16 22:52:59,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-16 22:52:59,846 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:52:59,846 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:52:59,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-16 22:53:00,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 22:53:00,065 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:53:00,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:53:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1706347041, now seen corresponding path program 1 times [2021-11-16 22:53:00,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 22:53:00,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797814063] [2021-11-16 22:53:00,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:53:00,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 22:53:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-16 22:53:00,231 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-16 22:53:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-16 22:53:00,473 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-16 22:53:00,474 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-16 22:53:00,474 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-16 22:53:00,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-16 22:53:00,478 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:53:00,480 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-16 22:53:00,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:53:00 BoogieIcfgContainer [2021-11-16 22:53:00,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-16 22:53:00,593 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-16 22:53:00,593 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-16 22:53:00,593 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-16 22:53:00,594 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:46:47" (3/4) ... [2021-11-16 22:53:00,596 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-16 22:53:00,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-16 22:53:00,596 INFO L158 Benchmark]: Toolchain (without parser) took 376609.66ms. Allocated memory was 104.9MB in the beginning and 660.6MB in the end (delta: 555.7MB). Free memory was 60.3MB in the beginning and 343.3MB in the end (delta: -283.1MB). Peak memory consumption was 273.3MB. Max. memory is 16.1GB. [2021-11-16 22:53:00,597 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 104.9MB. Free memory was 78.6MB in the beginning and 78.6MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 22:53:00,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1309.53ms. Allocated memory was 104.9MB in the beginning and 180.4MB in the end (delta: 75.5MB). Free memory was 60.0MB in the beginning and 113.6MB in the end (delta: -53.6MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2021-11-16 22:53:00,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 158.01ms. Allocated memory is still 180.4MB. Free memory was 113.6MB in the beginning and 98.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-11-16 22:53:00,600 INFO L158 Benchmark]: Boogie Preprocessor took 145.87ms. Allocated memory is still 180.4MB. Free memory was 98.0MB in the beginning and 82.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-16 22:53:00,600 INFO L158 Benchmark]: RCFGBuilder took 2105.85ms. Allocated memory is still 180.4MB. Free memory was 82.3MB in the beginning and 70.0MB in the end (delta: 12.4MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2021-11-16 22:53:00,603 INFO L158 Benchmark]: TraceAbstraction took 372880.67ms. Allocated memory was 180.4MB in the beginning and 660.6MB in the end (delta: 480.2MB). Free memory was 70.0MB in the beginning and 343.3MB in the end (delta: -273.4MB). Peak memory consumption was 426.0MB. Max. memory is 16.1GB. [2021-11-16 22:53:00,604 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 660.6MB. Free memory is still 343.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 22:53:00,604 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.42ms. Allocated memory is still 104.9MB. Free memory was 78.6MB in the beginning and 78.6MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1309.53ms. Allocated memory was 104.9MB in the beginning and 180.4MB in the end (delta: 75.5MB). Free memory was 60.0MB in the beginning and 113.6MB in the end (delta: -53.6MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 158.01ms. Allocated memory is still 180.4MB. Free memory was 113.6MB in the beginning and 98.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 145.87ms. Allocated memory is still 180.4MB. Free memory was 98.0MB in the beginning and 82.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 2105.85ms. Allocated memory is still 180.4MB. Free memory was 82.3MB in the beginning and 70.0MB in the end (delta: 12.4MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. * TraceAbstraction took 372880.67ms. Allocated memory was 180.4MB in the beginning and 660.6MB in the end (delta: 480.2MB). Free memory was 70.0MB in the beginning and 343.3MB in the end (delta: -273.4MB). Peak memory consumption was 426.0MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 660.6MB. Free memory is still 343.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s 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={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=0, sl_ldisc={30:0}, sl_netdev_ops={31: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 ; VAL [__this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=0, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256, var_group3={38:0}, var_group4={35:0}, var_group5={33:0}] [L6939] CALL, EXPR dev_alloc_skb(1U) VAL [\old(arg0)=1, __this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=0, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] CALL, EXPR ldv_malloc(sizeof(struct sk_buff)) VAL [\old(size)=243, __this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=0, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256] [L4847] COND FALSE !(__VERIFIER_nondet_int()) [L4852] return ((void *)0); VAL [\old(size)=243, \result={0:0}, __this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=0, size=243, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] RET, EXPR ldv_malloc(sizeof(struct sk_buff)) VAL [\old(arg0)=1, __this_module={18446744073709551567:18446744073709551569}, arg0=1, LDV_IN_INTERRUPT=0, ldv_malloc(sizeof(struct sk_buff))={0:0}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] return ldv_malloc(sizeof(struct sk_buff)); [L6939] RET, EXPR dev_alloc_skb(1U) VAL [__this_module={18446744073709551567:18446744073709551569}, dev_alloc_skb(1U)={0:0}, LDV_IN_INTERRUPT=0, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256, var_group3={38:0}, var_group4={35:0}, var_group5={33:0}] [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 [L6943] FCALL ldv_initialize() [L6944] FCALL ldv_handler_precall() VAL [__this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256, var_group2={0:0}, var_group3={38:0}, var_group4={35:0}, var_group5={33:0}] [L6945] CALL, EXPR slip_init() [L6729] int status ; [L6730] void *tmp ; VAL [__this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256] [L6732] COND FALSE !(slip_maxdev <= 3) VAL [__this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256] [L6740] CALL, EXPR kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L4871] void *tmp ; VAL [\old(flags)=208, \old(size)=2048, __this_module={18446744073709551567:18446744073709551569}, flags=208, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256] [L4873] CALL, EXPR kmalloc(size, flags | 32768U) VAL [__this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256] [L4862] void *tmp___2 ; [L4864] CALL, EXPR __kmalloc(size, flags) [L4857] CALL, EXPR ldv_malloc(size) VAL [__this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256] [L4847] COND TRUE __VERIFIER_nondet_int() [L4848] void *res = malloc(size); [L4849] CALL, EXPR ldv_is_err(res) [L4843] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [\result=0, __this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, ptr={-18446744073709555711:0}, ptr={-18446744073709555711:0}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256] [L4849] RET, EXPR ldv_is_err(res) [L4849] CALL assume_abort_if_not(!ldv_is_err(res)) [L4838] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551567:18446744073709551569}, cond=1, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256] [L4849] RET assume_abort_if_not(!ldv_is_err(res)) [L4850] return res; VAL [\old(size)=2048, \result={-18446744073709555711:0}, __this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, res={-18446744073709555711:0}, size=2048, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256] [L4857] RET, EXPR ldv_malloc(size) VAL [\old(size)=2048, \old(t)=4294967245, __this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-18446744073709555711:0}, size=2048, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256, t=4294967245] [L4857] return ldv_malloc(size); [L4864] RET, EXPR __kmalloc(size, flags) [L4864] tmp___2 = __kmalloc(size, flags) [L4865] return (tmp___2); VAL [\old(flags)=4294967245, \old(size)=2048, \result={-18446744073709555711:0}, __this_module={18446744073709551567:18446744073709551569}, flags=4294967245, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256, tmp___2={-18446744073709555711:0}] [L4873] RET, EXPR kmalloc(size, flags | 32768U) VAL [\old(flags)=208, \old(size)=2048, __this_module={18446744073709551567:18446744073709551569}, flags=208, kmalloc(size, flags | 32768U)={-18446744073709555711:0}, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256] [L4873] tmp = kmalloc(size, flags | 32768U) [L4874] return (tmp); VAL [\old(flags)=208, \old(size)=2048, \result={-18446744073709555711:0}, __this_module={18446744073709551567:18446744073709551569}, flags=208, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709555711:0}] [L6740] RET, EXPR kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6740] tmp = kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6741] slip_devs = (struct net_device **)tmp VAL [__this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp={-18446744073709555711:0}] [L6742] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L6747] CALL, EXPR tty_register_ldisc(1, & sl_ldisc) [L7287] return __VERIFIER_nondet_int(); [L6747] RET, EXPR tty_register_ldisc(1, & sl_ldisc) [L6747] status = tty_register_ldisc(1, & sl_ldisc) [L6748] COND FALSE !(status != 0) VAL [__this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, status=0, tmp={-18446744073709555711:0}] [L6753] return (status); VAL [\result=0, __this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, status=0, tmp={-18446744073709555711:0}] [L6945] RET, EXPR slip_init() [L6945] tmp = slip_init() [L6946] COND FALSE !(tmp != 0) VAL [__this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=0, var_group2={0:0}, var_group3={38:0}, var_group4={35:0}, var_group5={33:0}] [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={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=0, tmp___1=-2, var_group2={0:0}, var_group3={38:0}, var_group4={35:0}, var_group5={33:0}] [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={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=0, tmp___0=9, tmp___1=-2, var_group2={0:0}, var_group3={38:0}, var_group4={35:0}, var_group5={33:0}] [L7022] COND TRUE ldv_s_sl_ldisc_tty_ldisc_ops == 0 VAL [__this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=0, tmp___0=9, tmp___1=-2, var_group2={0:0}, var_group3={38:0}, var_group4={35:0}, var_group5={33:0}] [L7023] FCALL ldv_handler_precall() VAL [__this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=0, tmp___0=9, tmp___1=-2, var_group2={0:0}, var_group3={38:0}, var_group4={35:0}, var_group5={33:0}] [L7024] CALL ldv_slip_open_3(&var_group5) [L7117] ldv_func_ret_type___1 ldv_func_res ; [L7118] int tmp ; [L7120] CALL, EXPR slip_open(tty) [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 ; [L6044] CALL, EXPR capable(12) [L7172] return __VERIFIER_nondet_int(); [L6044] RET, EXPR capable(12) [L6044] tmp = capable(12) [L6045] COND FALSE !(tmp == 0) [L6049] EXPR tty->ops [L6049] EXPR (tty->ops)->write VAL [(tty->ops)->write={-38:39}, __this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tty={33:0}, tty={33:0}, tty->ops={18446744073709551578:-3}] [L6049-L6051] COND FALSE !((unsigned long )(tty->ops)->write == (unsigned long )((int (* )(struct tty_struct * , unsigned char const * , int ))0)) [L6055] FCALL rtnl_lock() [L6056] CALL sl_sync() [L5925] int i ; [L5926] struct net_device *dev ; [L5927] struct slip *sl ; [L5928] void *tmp ; [L5930] i = 0 VAL [__this_module={18446744073709551567:18446744073709551569}, i=0, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5951] COND TRUE i < slip_maxdev VAL [__this_module={18446744073709551567:18446744073709551569}, i=0, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711: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)) VAL [__this_module={18446744073709551567:18446744073709551569}, dev={-50:51}, i=0, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5938] CALL, EXPR netdev_priv((struct net_device const *)dev) VAL [__this_module={18446744073709551567:18446744073709551569}, dev={-50:51}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L4903] return ((void *)dev + 2496U); VAL [\result={-50:2547}, __this_module={18446744073709551567:18446744073709551569}, dev={-50:51}, dev={-50:51}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5938] RET, EXPR netdev_priv((struct net_device const *)dev) VAL [__this_module={18446744073709551567:18446744073709551569}, dev={-50:51}, i=0, LDV_IN_INTERRUPT=1, netdev_priv((struct net_device const *)dev)={-50:2547}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711: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 VAL [(unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U=1, __this_module={18446744073709551567:18446744073709551569}, dev={-50:51}, i=0, LDV_IN_INTERRUPT=1, sl={-50:2547}, sl->tty={-41:42}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp={-50:2547}] [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={18446744073709551567:18446744073709551569}, dev={-50:51}, i=1, LDV_IN_INTERRUPT=1, sl={-50:2547}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp={-50:2547}] [L5951] COND TRUE i < slip_maxdev VAL [__this_module={18446744073709551567:18446744073709551569}, dev={-50:51}, i=1, LDV_IN_INTERRUPT=1, sl={-50:2547}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp={-50:2547}] [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={18446744073709551567:18446744073709551569}, dev={18446744073709551559:57}, i=1, LDV_IN_INTERRUPT=1, sl={-50:2547}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp={-50:2547}] [L6056] RET sl_sync() [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 [(unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250=0, __this_module={18446744073709551567:18446744073709551569}, err=-17, LDV_IN_INTERRUPT=1, sl={-42:43}, sl->magic=-4, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tty={33:0}, tty={33:0}] [L6059] COND FALSE !((unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250) [L6063] err = -23 VAL [__this_module={18446744073709551567:18446744073709551569}, err=-23, LDV_IN_INTERRUPT=1, sl={-42:43}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tty={33:0}, tty={33:0}] [L6064] CALL, EXPR tty_devnum(tty) VAL [__this_module={18446744073709551567:18446744073709551569}, arg0={33:0}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L7276] return __VERIFIER_nondet_uint(); [L6064] RET, EXPR tty_devnum(tty) VAL [__this_module={18446744073709551567:18446744073709551569}, err=-23, LDV_IN_INTERRUPT=1, sl={-42:43}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tty={33:0}, tty={33:0}, tty_devnum(tty)=18446744073709551583] [L6064] tmp___0 = tty_devnum(tty) [L6065] CALL, EXPR sl_alloc(tmp___0) [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 [\old(line)=4294967263, __key={29:0}, __key___0={49:0}, __key___1={50:0}, __this_module={18446744073709551567:18446744073709551569}, dev={0:0}, LDV_IN_INTERRUPT=1, line=4294967263, name={47:0}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5973] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L5977] i = 0 VAL [\old(line)=4294967263, __key={29:0}, __key___0={49:0}, __key___1={50:0}, __this_module={18446744073709551567:18446744073709551569}, dev={0:0}, i=0, LDV_IN_INTERRUPT=1, line=4294967263, name={47:0}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5987] COND TRUE i < slip_maxdev VAL [\old(line)=4294967263, __key={29:0}, __key___0={49:0}, __key___1={50:0}, __this_module={18446744073709551567:18446744073709551569}, dev={0:0}, i=0, LDV_IN_INTERRUPT=1, line=4294967263, name={47:0}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711: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 [\old(line)=4294967263, __key={29:0}, __key___0={49:0}, __key___1={50:0}, __this_module={18446744073709551567:18446744073709551569}, dev={-50:51}, i=1, LDV_IN_INTERRUPT=1, line=4294967263, name={47:0}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5987] COND TRUE i < slip_maxdev VAL [\old(line)=4294967263, __key={29:0}, __key___0={49:0}, __key___1={50:0}, __this_module={18446744073709551567:18446744073709551569}, dev={-50:51}, i=1, LDV_IN_INTERRUPT=1, line=4294967263, name={47:0}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711: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 [\old(line)=4294967263, __key={29:0}, __key___0={49:0}, __key___1={50:0}, __this_module={18446744073709551567:18446744073709551569}, dev={18446744073709551559:57}, i=1, LDV_IN_INTERRUPT=1, line=4294967263, name={47:0}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5992] COND FALSE !(i >= slip_maxdev) VAL [\old(line)=4294967263, __key={29:0}, __key___0={49:0}, __key___1={50:0}, __this_module={18446744073709551567:18446744073709551569}, dev={18446744073709551559:57}, i=1, LDV_IN_INTERRUPT=1, line=4294967263, name={47:0}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L5996] COND FALSE !((unsigned long )dev != (unsigned long )((struct net_device *)0)) VAL [\old(line)=4294967263, __key={29:0}, __key___0={49:0}, __key___1={50:0}, __this_module={18446744073709551567:18446744073709551569}, dev={18446744073709551559:57}, i=1, LDV_IN_INTERRUPT=1, line=4294967263, name={47:0}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L6008] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) [L6010] CALL, EXPR alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L7168] CALL, EXPR ldv_malloc(sizeof(struct net_device)) VAL [__this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L4847] COND TRUE __VERIFIER_nondet_int() [L4848] void *res = malloc(size); [L4849] CALL, EXPR ldv_is_err(res) [L4843] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [\result=0, __this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, ptr={-4095:0}, ptr={-4095:0}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L4849] RET, EXPR ldv_is_err(res) [L4849] CALL assume_abort_if_not(!ldv_is_err(res)) [L4838] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551567:18446744073709551569}, cond=1, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L4849] RET assume_abort_if_not(!ldv_is_err(res)) [L4850] return res; VAL [\old(size)=2255, \result={-4095:0}, __this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, res={-4095:0}, size=2255, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L7168] RET, EXPR ldv_malloc(sizeof(struct net_device)) VAL [\old(arg0)=472, \old(arg3)=1, \old(arg4)=1, __this_module={18446744073709551567:18446744073709551569}, arg0=472, arg1={47:0}, arg1={47:0}, arg2={-1:10}, arg2={-1:10}, arg3=1, arg4=1, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct net_device))={-4095:0}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L7168] return ldv_malloc(sizeof(struct net_device)); [L6010] RET, EXPR alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [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 [\old(line)=4294967263, __key={29:0}, __key___0={49:0}, __key___1={50:0}, __this_module={18446744073709551567:18446744073709551569}, dev={-4095:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967263, name={47:0}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L6018] CALL, EXPR netdev_priv((struct net_device const *)dev) VAL [__this_module={18446744073709551567:18446744073709551569}, dev={-4095:0}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L4903] return ((void *)dev + 2496U); VAL [\result={-4095:2496}, __this_module={18446744073709551567:18446744073709551569}, dev={-4095:0}, dev={-4095:0}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L6018] RET, EXPR netdev_priv((struct net_device const *)dev) VAL [\old(line)=4294967263, __key={29:0}, __key___0={49:0}, __key___1={50:0}, __this_module={18446744073709551567:18446744073709551569}, dev={-4095:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967263, name={47:0}, netdev_priv((struct net_device const *)dev)={-4095:2496}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711: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 [L6022] CALL spinlock_check(& sl->lock) [L4778] return (& lock->ldv_5934.rlock); VAL [\result={-4095:2516}, __this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, lock={-4095:2516}, lock={-4095:2516}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L6022] RET spinlock_check(& sl->lock) [L6023] FCALL __raw_spin_lock_init(& sl->lock.ldv_5934.rlock, "&(&sl->lock)->rlock", & __key) [L6024] sl->mode = 8U VAL [\old(line)=4294967263, __key={29:0}, __key___0={49:0}, __key___1={50:0}, __this_module={18446744073709551567:18446744073709551569}, dev={-4095:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967263, name={47:0}, sl={-4095:2496}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp___1={-4095:2496}] [L6025] FCALL init_timer_key(& sl->keepalive_timer, "&sl->keepalive_timer", & __key___0) VAL [\old(line)=4294967263, __key={29:0}, __key___0={49:0}, __key___1={50:0}, __this_module={18446744073709551567:18446744073709551569}, dev={-4095:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967263, name={47:0}, sl={-4095:2496}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp___1={-4095:2496}] [L6026] sl->keepalive_timer.data = (unsigned long )sl [L6027] sl->keepalive_timer.function = & sl_keepalive VAL [\old(line)=4294967263, __key={29:0}, __key___0={49:0}, __key___1={50:0}, __this_module={18446744073709551567:18446744073709551569}, dev={-4095:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967263, name={47:0}, sl={-4095:2496}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp___1={-4095:2496}] [L6028] FCALL init_timer_key(& sl->outfill_timer, "&sl->outfill_timer", & __key___1) VAL [\old(line)=4294967263, __key={29:0}, __key___0={49:0}, __key___1={50:0}, __this_module={18446744073709551567:18446744073709551569}, dev={-4095:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967263, name={47:0}, sl={-4095:2496}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp___1={-4095:2496}] [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 [\old(line)=4294967263, \result={-4095:2496}, __this_module={18446744073709551567:18446744073709551569}, dev={-4095:0}, i=1, LDV_IN_INTERRUPT=1, line=4294967263, sl={-4095:2496}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp___1={-4095:2496}] [L6065] RET, EXPR sl_alloc(tmp___0) [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 VAL [__this_module={18446744073709551567:18446744073709551569}, err=-23, LDV_IN_INTERRUPT=1, sl={-4095:2496}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tmp___0=4294967263, tty={33:0}, tty={33:0}] [L6072] CALL, EXPR tty_devnum(tty) VAL [__this_module={18446744073709551567:18446744073709551569}, arg0={33:0}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L7276] return __VERIFIER_nondet_uint(); [L6072] RET, EXPR tty_devnum(tty) VAL [__this_module={18446744073709551567:18446744073709551569}, err=-23, LDV_IN_INTERRUPT=1, sl={-4095:2496}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tmp___0=4294967263, tty={33:0}, tty={33:0}, tty_devnum(tty)=18446744073709551570] [L6072] sl->line = tty_devnum(tty) [L6073] CALL, EXPR get_current() VAL [__this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L4746] struct task_struct *pfo_ret__ ; [L4749] case 1UL: [L4752] case 2UL: [L4755] case 4UL: [L4758] case 8UL: VAL [__this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L4765] return (pfo_ret__); VAL [\result={18446744073709551574:-5}, __this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, pfo_ret__={18446744073709551574:-5}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L6073] RET, EXPR get_current() VAL [__this_module={18446744073709551567:18446744073709551569}, err=-23, get_current()={18446744073709551574:-5}, LDV_IN_INTERRUPT=1, sl={-4095:2496}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tmp___0=4294967263, tty={33:0}, tty={33:0}] [L6073] tmp___1 = get_current() [L6074] EXPR tmp___1->pid [L6074] sl->pid = tmp___1->pid [L6075] CALL, EXPR constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) VAL [\old(nr)=0, __this_module={18446744073709551567:18446744073709551569}, addr={-4095:2668}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] [L4735] EXPR addr + (unsigned long )(nr / 64U) [L4735] return ((int )((unsigned long )*(addr + (unsigned long )(nr / 64U)) >> ((int )nr & 63)) & 1); [L6075] RET, EXPR constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) VAL [__this_module={18446744073709551567:18446744073709551569}, constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags))=-6, err=-23, LDV_IN_INTERRUPT=1, sl={-4095:2496}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tmp___0=4294967263, tmp___1={18446744073709551574:-5}, tty={33:0}, tty={33:0}] [L6075] tmp___2 = constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) [L6076] COND FALSE !(tmp___2 == 0) VAL [__this_module={18446744073709551567:18446744073709551569}, err=-23, LDV_IN_INTERRUPT=1, sl={-4095:2496}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tmp___0=4294967263, tmp___1={18446744073709551574:-5}, tmp___2=-6, tty={33:0}, tty={33:0}] [L6090] EXPR sl->keepalive VAL [__this_module={18446744073709551567:18446744073709551569}, err=-23, LDV_IN_INTERRUPT=1, sl={-4095:2496}, sl->keepalive=512, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tmp___0=4294967263, tmp___1={18446744073709551574:-5}, tmp___2=-6, tty={33:0}, tty={33:0}] [L6090] COND FALSE !((unsigned int )sl->keepalive != 0U) [L6095] EXPR sl->outfill VAL [__this_module={18446744073709551567:18446744073709551569}, err=-23, LDV_IN_INTERRUPT=1, sl={-4095:2496}, sl->outfill=768, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tmp___0=4294967263, tmp___1={18446744073709551574:-5}, tmp___2=-6, tty={33:0}, tty={33:0}] [L6095] COND FALSE !((unsigned int )sl->outfill != 0U) [L6100] FCALL rtnl_unlock() VAL [__this_module={18446744073709551567:18446744073709551569}, err=-23, LDV_IN_INTERRUPT=1, sl={-4095:2496}, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256, tmp=1, tmp___0=4294967263, tmp___1={18446744073709551574:-5}, tmp___2=-6, tty={33:0}, tty={33:0}] [L6101] tty->receive_room = 65536U [L6102] EXPR sl->dev [L6102] EXPR (sl->dev)->base_addr [L6102] return ((int )(sl->dev)->base_addr); [L7120] RET, EXPR slip_open(tty) [L7120] tmp = slip_open(tty) [L7121] ldv_func_res = tmp [L7122] CALL ldv_check_callback_ret_val(ldv_func_res) [L7135] COND FALSE !(ret_val <= 0) [L7137] CALL ldv_error() [L7129] reach_error() VAL [__this_module={18446744073709551567:18446744073709551569}, LDV_IN_INTERRUPT=1, sl_ldisc={30:0}, sl_netdev_ops={31:0}, slip_devs={-18446744073709555711:0}, slip_maxdev=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 44 procedures, 964 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 372.7s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 257.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 59281 SdHoareTripleChecker+Valid, 177.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55929 mSDsluCounter, 332922 SdHoareTripleChecker+Invalid, 162.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 26027 IncrementalHoareTripleChecker+Unchecked, 294388 mSDsCounter, 23947 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 170054 IncrementalHoareTripleChecker+Invalid, 220037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23947 mSolverCounterUnsat, 38534 mSDtfsCounter, 170054 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2053 GetRequests, 1638 SyntacticMatches, 43 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 7892 ImplicationChecksByTransitivity, 131.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3022occurred in iteration=19, InterpolantAutomatonStates: 272, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 27126 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 32.1s SatisfiabilityAnalysisTime, 77.0s InterpolantComputationTime, 3304 NumberOfCodeBlocks, 3304 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3386 ConstructedInterpolants, 89 QuantifiedInterpolants, 30994 SizeOfPredicates, 127 NumberOfNonLiveVariables, 7150 ConjunctsInSsa, 337 ConjunctsInUnsatCore, 28 InterpolantComputations, 15 PerfectInterpolantSequences, 433/474 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-16 22:53:00,831 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-16 22:53:00,858 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 137 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-dev-0f8a17c [2021-11-16 22:53:02,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 22:53:02,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 22:53:02,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 22:53:02,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 22:53:02,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 22:53:02,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 22:53:02,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 22:53:02,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 22:53:02,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 22:53:02,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 22:53:02,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 22:53:02,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 22:53:02,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 22:53:02,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 22:53:02,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 22:53:02,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 22:53:02,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 22:53:02,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 22:53:02,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 22:53:02,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 22:53:02,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 22:53:02,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 22:53:02,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 22:53:02,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 22:53:02,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 22:53:02,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 22:53:02,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 22:53:02,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 22:53:02,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 22:53:02,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 22:53:02,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 22:53:02,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 22:53:02,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 22:53:02,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 22:53:02,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 22:53:02,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 22:53:02,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 22:53:02,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 22:53:02,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 22:53:02,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 22:53:02,379 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-16 22:53:02,409 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 22:53:02,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 22:53:02,410 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 22:53:02,411 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 22:53:02,411 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 22:53:02,411 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 22:53:02,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 22:53:02,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 22:53:02,413 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 22:53:02,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 22:53:02,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 22:53:02,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 22:53:02,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 22:53:02,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 22:53:02,414 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-16 22:53:02,414 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-16 22:53:02,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 22:53:02,414 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 22:53:02,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 22:53:02,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 22:53:02,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 22:53:02,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 22:53:02,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 22:53:02,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 22:53:02,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 22:53:02,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 22:53:02,415 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-16 22:53:02,415 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-16 22:53:02,416 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 22:53:02,416 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 22:53:02,416 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 22:53:02,416 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 22:53:02,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-16 22:53:02,416 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-16 22:53:02,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 22:53:02,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 22:53:02,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 22:53:02,722 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 22:53:02,723 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 22:53:02,724 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-16 22:53:02,783 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6744dbb9/d54492f0bd7a4518851c1fd811774a03/FLAGe9ba9312b [2021-11-16 22:53:03,359 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 22:53:03,360 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-16 22:53:03,389 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6744dbb9/d54492f0bd7a4518851c1fd811774a03/FLAGe9ba9312b [2021-11-16 22:53:03,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6744dbb9/d54492f0bd7a4518851c1fd811774a03 [2021-11-16 22:53:03,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 22:53:03,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 22:53:03,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 22:53:03,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 22:53:03,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 22:53:03,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:53:03" (1/1) ... [2021-11-16 22:53:03,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700118a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:03, skipping insertion in model container [2021-11-16 22:53:03,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:53:03" (1/1) ... [2021-11-16 22:53:03,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 22:53:03,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 22:53:04,626 WARN L230 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-16 22:53:04,647 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 22:53:04,686 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 22:53:04,883 WARN L230 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-16 22:53:04,889 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 22:53:04,949 INFO L208 MainTranslator]: Completed translation [2021-11-16 22:53:04,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:04 WrapperNode [2021-11-16 22:53:04,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 22:53:04,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 22:53:04,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 22:53:04,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 22:53:04,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:04" (1/1) ... [2021-11-16 22:53:05,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:04" (1/1) ... [2021-11-16 22:53:05,102 INFO L137 Inliner]: procedures = 170, calls = 812, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 2689 [2021-11-16 22:53:05,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 22:53:05,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 22:53:05,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 22:53:05,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 22:53:05,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:04" (1/1) ... [2021-11-16 22:53:05,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:04" (1/1) ... [2021-11-16 22:53:05,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:04" (1/1) ... [2021-11-16 22:53:05,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:04" (1/1) ... [2021-11-16 22:53:05,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:04" (1/1) ... [2021-11-16 22:53:05,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:04" (1/1) ... [2021-11-16 22:53:05,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:04" (1/1) ... [2021-11-16 22:53:05,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 22:53:05,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 22:53:05,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 22:53:05,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 22:53:05,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:04" (1/1) ... [2021-11-16 22:53:05,203 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 22:53:05,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 22:53:05,225 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-16 22:53:05,231 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-16 22:53:05,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-16 22:53:05,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-16 22:53:05,255 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-11-16 22:53:05,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-16 22:53:05,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-16 22:53:05,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-16 22:53:05,256 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2021-11-16 22:53:05,256 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2021-11-16 22:53:05,256 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2021-11-16 22:53:05,256 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2021-11-16 22:53:05,256 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2021-11-16 22:53:05,256 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2021-11-16 22:53:05,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-16 22:53:05,256 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-16 22:53:05,257 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2021-11-16 22:53:05,257 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2021-11-16 22:53:05,257 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-16 22:53:05,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-16 22:53:05,257 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2021-11-16 22:53:05,257 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2021-11-16 22:53:05,257 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2021-11-16 22:53:05,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2021-11-16 22:53:05,257 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2021-11-16 22:53:05,258 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2021-11-16 22:53:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-16 22:53:05,258 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-16 22:53:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2021-11-16 22:53:05,258 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2021-11-16 22:53:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-16 22:53:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-16 22:53:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-16 22:53:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-16 22:53:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2021-11-16 22:53:05,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2021-11-16 22:53:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2021-11-16 22:53:05,259 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2021-11-16 22:53:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2021-11-16 22:53:05,259 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2021-11-16 22:53:05,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-16 22:53:05,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-16 22:53:05,260 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2021-11-16 22:53:05,260 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2021-11-16 22:53:05,260 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2021-11-16 22:53:05,260 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2021-11-16 22:53:05,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 22:53:05,260 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2021-11-16 22:53:05,261 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2021-11-16 22:53:05,261 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2021-11-16 22:53:05,261 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2021-11-16 22:53:05,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 22:53:05,261 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2021-11-16 22:53:05,261 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2021-11-16 22:53:05,261 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2021-11-16 22:53:05,262 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2021-11-16 22:53:05,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 22:53:05,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 22:53:05,263 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-16 22:53:05,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-16 22:53:05,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-16 22:53:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-16 22:53:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2021-11-16 22:53:05,264 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2021-11-16 22:53:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 22:53:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2021-11-16 22:53:05,264 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2021-11-16 22:53:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2021-11-16 22:53:05,264 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2021-11-16 22:53:05,265 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2021-11-16 22:53:05,265 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2021-11-16 22:53:05,265 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2021-11-16 22:53:05,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2021-11-16 22:53:05,265 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2021-11-16 22:53:05,265 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2021-11-16 22:53:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-16 22:53:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-16 22:53:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-16 22:53:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 22:53:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-16 22:53:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2021-11-16 22:53:05,266 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2021-11-16 22:53:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 22:53:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2021-11-16 22:53:05,267 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2021-11-16 22:53:05,267 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2021-11-16 22:53:05,267 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2021-11-16 22:53:05,267 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-11-16 22:53:05,267 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-11-16 22:53:05,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-16 22:53:05,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-16 22:53:05,268 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-11-16 22:53:05,268 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-11-16 22:53:05,268 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2021-11-16 22:53:05,268 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2021-11-16 22:53:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-11-16 22:53:05,269 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-11-16 22:53:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-11-16 22:53:05,269 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-11-16 22:53:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2021-11-16 22:53:05,270 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2021-11-16 22:53:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2021-11-16 22:53:05,270 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2021-11-16 22:53:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-16 22:53:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2021-11-16 22:53:05,270 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2021-11-16 22:53:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2021-11-16 22:53:05,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2021-11-16 22:53:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2021-11-16 22:53:05,271 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2021-11-16 22:53:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2021-11-16 22:53:05,271 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2021-11-16 22:53:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 22:53:05,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 22:53:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2021-11-16 22:53:05,272 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2021-11-16 22:53:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2021-11-16 22:53:05,272 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2021-11-16 22:53:05,733 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 22:53:05,736 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 22:53:13,039 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 22:53:13,048 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 22:53:13,048 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-16 22:53:13,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:53:13 BoogieIcfgContainer [2021-11-16 22:53:13,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 22:53:13,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 22:53:13,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 22:53:13,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 22:53:13,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:53:03" (1/3) ... [2021-11-16 22:53:13,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41706976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:53:13, skipping insertion in model container [2021-11-16 22:53:13,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:04" (2/3) ... [2021-11-16 22:53:13,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41706976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:53:13, skipping insertion in model container [2021-11-16 22:53:13,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:53:13" (3/3) ... [2021-11-16 22:53:13,057 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-16 22:53:13,060 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 22:53:13,060 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 22:53:13,093 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 22:53:13,097 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-16 22:53:13,097 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 22:53:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 964 states, 712 states have (on average 1.4297752808988764) internal successors, (1018), 739 states have internal predecessors, (1018), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) [2021-11-16 22:53:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-16 22:53:13,126 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:53:13,127 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] [2021-11-16 22:53:13,127 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:53:13,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:53:13,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1312205542, now seen corresponding path program 1 times [2021-11-16 22:53:13,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:53:13,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733528436] [2021-11-16 22:53:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:53:13,140 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:53:13,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:53:13,142 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-16 22:53:13,143 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-16 22:53:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:53:13,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-16 22:53:13,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:53:13,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-16 22:53:13,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:53:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:53:14,252 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 22:53:14,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733528436] [2021-11-16 22:53:14,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733528436] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 22:53:14,253 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:53:14,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2021-11-16 22:53:14,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573012582] [2021-11-16 22:53:14,255 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 22:53:14,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 22:53:14,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 22:53:14,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 22:53:14,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:53:14,293 INFO L87 Difference]: Start difference. First operand has 964 states, 712 states have (on average 1.4297752808988764) internal successors, (1018), 739 states have internal predecessors, (1018), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 4 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-16 22:53:14,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:53:14,494 INFO L93 Difference]: Finished difference Result 1924 states and 2874 transitions. [2021-11-16 22:53:14,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-16 22:53:14,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 4 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 59 [2021-11-16 22:53:14,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:53:14,516 INFO L225 Difference]: With dead ends: 1924 [2021-11-16 22:53:14,517 INFO L226 Difference]: Without dead ends: 925 [2021-11-16 22:53:14,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-16 22:53:14,528 INFO L933 BasicCegarLoop]: 1416 mSDtfsCounter, 1417 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 22:53:14,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1417 Valid, 1416 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 22:53:14,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2021-11-16 22:53:14,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 925. [2021-11-16 22:53:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 682 states have (on average 1.4193548387096775) internal successors, (968), 706 states have internal predecessors, (968), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2021-11-16 22:53:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1366 transitions. [2021-11-16 22:53:14,635 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1366 transitions. Word has length 59 [2021-11-16 22:53:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:53:14,636 INFO L470 AbstractCegarLoop]: Abstraction has 925 states and 1366 transitions. [2021-11-16 22:53:14,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 4 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-16 22:53:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1366 transitions. [2021-11-16 22:53:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-16 22:53:14,644 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:53:14,644 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] [2021-11-16 22:53:14,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-16 22:53:14,856 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-16 22:53:14,856 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:53:14,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:53:14,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1735852264, now seen corresponding path program 1 times [2021-11-16 22:53:14,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:53:14,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208779602] [2021-11-16 22:53:14,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:53:14,858 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:53:14,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:53:14,859 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-16 22:53:14,860 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-16 22:53:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:53:15,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 22:53:15,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:53:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 22:53:15,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:53:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:53:15,650 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 22:53:15,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208779602] [2021-11-16 22:53:15,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208779602] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 22:53:15,650 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:53:15,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-16 22:53:15,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18565281] [2021-11-16 22:53:15,650 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 22:53:15,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 22:53:15,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 22:53:15,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 22:53:15,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:53:15,652 INFO L87 Difference]: Start difference. First operand 925 states and 1366 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-16 22:53:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:53:15,806 INFO L93 Difference]: Finished difference Result 1833 states and 2709 transitions. [2021-11-16 22:53:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-16 22:53:15,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-11-16 22:53:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:53:15,812 INFO L225 Difference]: With dead ends: 1833 [2021-11-16 22:53:15,812 INFO L226 Difference]: Without dead ends: 925 [2021-11-16 22:53:15,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-16 22:53:15,816 INFO L933 BasicCegarLoop]: 1365 mSDtfsCounter, 2 mSDsluCounter, 4088 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5453 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 22:53:15,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 5453 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 22:53:15,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2021-11-16 22:53:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 925. [2021-11-16 22:53:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 682 states have (on average 1.4178885630498534) internal successors, (967), 706 states have internal predecessors, (967), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2021-11-16 22:53:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1365 transitions. [2021-11-16 22:53:15,859 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1365 transitions. Word has length 59 [2021-11-16 22:53:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:53:15,860 INFO L470 AbstractCegarLoop]: Abstraction has 925 states and 1365 transitions. [2021-11-16 22:53:15,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-16 22:53:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1365 transitions. [2021-11-16 22:53:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-16 22:53:15,861 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:53:15,861 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] [2021-11-16 22:53:15,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-16 22:53:16,073 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-16 22:53:16,074 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:53:16,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:53:16,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1026212091, now seen corresponding path program 1 times [2021-11-16 22:53:16,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:53:16,075 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899897830] [2021-11-16 22:53:16,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:53:16,075 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:53:16,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:53:16,076 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-16 22:53:16,079 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-16 22:53:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:53:16,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-16 22:53:16,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:53:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-16 22:53:17,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:53:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 22:53:18,876 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 22:53:18,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899897830] [2021-11-16 22:53:18,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899897830] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 22:53:18,876 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:53:18,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2021-11-16 22:53:18,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588301460] [2021-11-16 22:53:18,876 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 22:53:18,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-16 22:53:18,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 22:53:18,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-16 22:53:18,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-11-16 22:53:18,877 INFO L87 Difference]: Start difference. First operand 925 states and 1365 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (9), 6 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-16 22:53:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:53:24,490 INFO L93 Difference]: Finished difference Result 2756 states and 4071 transitions. [2021-11-16 22:53:24,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-16 22:53:24,492 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (9), 6 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2021-11-16 22:53:24,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:53:24,502 INFO L225 Difference]: With dead ends: 2756 [2021-11-16 22:53:24,502 INFO L226 Difference]: Without dead ends: 1837 [2021-11-16 22:53:24,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2021-11-16 22:53:24,508 INFO L933 BasicCegarLoop]: 2496 mSDtfsCounter, 1368 mSDsluCounter, 27196 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 29692 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-11-16 22:53:24,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1377 Valid, 29692 Invalid, 609 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2021-11-16 22:53:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2021-11-16 22:53:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1823. [2021-11-16 22:53:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1823 states, 1342 states have (on average 1.4187779433681074) internal successors, (1904), 1390 states have internal predecessors, (1904), 390 states have call successors, (390), 89 states have call predecessors, (390), 90 states have return successors, (391), 386 states have call predecessors, (391), 390 states have call successors, (391) [2021-11-16 22:53:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2685 transitions. [2021-11-16 22:53:24,584 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2685 transitions. Word has length 62 [2021-11-16 22:53:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:53:24,585 INFO L470 AbstractCegarLoop]: Abstraction has 1823 states and 2685 transitions. [2021-11-16 22:53:24,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (9), 6 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-16 22:53:24,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2685 transitions. [2021-11-16 22:53:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-16 22:53:24,587 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:53:24,587 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] [2021-11-16 22:53:24,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-16 22:53:24,797 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-16 22:53:24,797 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:53:24,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:53:24,798 INFO L85 PathProgramCache]: Analyzing trace with hash 12706885, now seen corresponding path program 1 times [2021-11-16 22:53:24,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:53:24,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068120662] [2021-11-16 22:53:24,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:53:24,799 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:53:24,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:53:24,800 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-16 22:53:24,800 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-16 22:53:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:53:25,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 22:53:25,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:53:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:53:25,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:53:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:53:25,410 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 22:53:25,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068120662] [2021-11-16 22:53:25,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068120662] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 22:53:25,410 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:53:25,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-16 22:53:25,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883117584] [2021-11-16 22:53:25,411 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 22:53:25,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 22:53:25,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 22:53:25,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 22:53:25,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:53:25,412 INFO L87 Difference]: Start difference. First operand 1823 states and 2685 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-16 22:53:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:53:28,250 INFO L93 Difference]: Finished difference Result 4175 states and 6449 transitions. [2021-11-16 22:53:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 22:53:28,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 65 [2021-11-16 22:53:28,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:53:28,268 INFO L225 Difference]: With dead ends: 4175 [2021-11-16 22:53:28,268 INFO L226 Difference]: Without dead ends: 4173 [2021-11-16 22:53:28,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-11-16 22:53:28,271 INFO L933 BasicCegarLoop]: 3279 mSDtfsCounter, 2076 mSDsluCounter, 7145 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2245 SdHoareTripleChecker+Valid, 10424 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-16 22:53:28,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2245 Valid, 10424 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-11-16 22:53:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2021-11-16 22:53:28,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 1827. [2021-11-16 22:53:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1346 states have (on average 1.4175334323922735) internal successors, (1908), 1394 states have internal predecessors, (1908), 390 states have call successors, (390), 89 states have call predecessors, (390), 90 states have return successors, (391), 386 states have call predecessors, (391), 390 states have call successors, (391) [2021-11-16 22:53:28,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2689 transitions. [2021-11-16 22:53:28,364 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2689 transitions. Word has length 65 [2021-11-16 22:53:28,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:53:28,364 INFO L470 AbstractCegarLoop]: Abstraction has 1827 states and 2689 transitions. [2021-11-16 22:53:28,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-16 22:53:28,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2689 transitions. [2021-11-16 22:53:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-16 22:53:28,368 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:53:28,370 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, 1, 1] [2021-11-16 22:53:28,381 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-16 22:53:28,580 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-16 22:53:28,580 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:53:28,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:53:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash -683622511, now seen corresponding path program 1 times [2021-11-16 22:53:28,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:53:28,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198017295] [2021-11-16 22:53:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:53:28,582 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:53:28,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:53:28,582 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-16 22:53:28,584 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-16 22:53:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:53:28,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 22:53:28,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:53:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:53:29,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:53:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:53:30,086 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 22:53:30,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198017295] [2021-11-16 22:53:30,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1198017295] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 22:53:30,087 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:53:30,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2021-11-16 22:53:30,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389727752] [2021-11-16 22:53:30,087 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 22:53:30,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 22:53:30,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 22:53:30,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 22:53:30,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:53:30,089 INFO L87 Difference]: Start difference. First operand 1827 states and 2689 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2021-11-16 22:53:38,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:53:38,587 INFO L93 Difference]: Finished difference Result 5597 states and 8505 transitions. [2021-11-16 22:53:38,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:53:38,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 75 [2021-11-16 22:53:38,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:53:38,603 INFO L225 Difference]: With dead ends: 5597 [2021-11-16 22:53:38,604 INFO L226 Difference]: Without dead ends: 3811 [2021-11-16 22:53:38,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-16 22:53:38,610 INFO L933 BasicCegarLoop]: 1850 mSDtfsCounter, 2955 mSDsluCounter, 2292 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3093 SdHoareTripleChecker+Valid, 4142 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2021-11-16 22:53:38,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3093 Valid, 4142 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2021-11-16 22:53:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3811 states. [2021-11-16 22:53:38,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3811 to 1849. [2021-11-16 22:53:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1366 states have (on average 1.417276720351391) internal successors, (1936), 1414 states have internal predecessors, (1936), 392 states have call successors, (392), 89 states have call predecessors, (392), 90 states have return successors, (393), 388 states have call predecessors, (393), 392 states have call successors, (393) [2021-11-16 22:53:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2721 transitions. [2021-11-16 22:53:38,710 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2721 transitions. Word has length 75 [2021-11-16 22:53:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:53:38,710 INFO L470 AbstractCegarLoop]: Abstraction has 1849 states and 2721 transitions. [2021-11-16 22:53:38,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2021-11-16 22:53:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2721 transitions. [2021-11-16 22:53:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-16 22:53:38,712 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:53:38,712 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, 1, 1, 1, 1] [2021-11-16 22:53:38,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-16 22:53:38,922 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-16 22:53:38,922 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:53:38,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:53:38,923 INFO L85 PathProgramCache]: Analyzing trace with hash -761624014, now seen corresponding path program 1 times [2021-11-16 22:53:38,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:53:38,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987762936] [2021-11-16 22:53:38,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:53:38,924 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:53:38,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:53:38,925 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-16 22:53:38,926 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-16 22:53:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:53:39,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 22:53:39,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:53:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:53:39,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:53:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:53:39,703 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 22:53:39,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987762936] [2021-11-16 22:53:39,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987762936] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 22:53:39,704 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:53:39,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-16 22:53:39,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924740206] [2021-11-16 22:53:39,704 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 22:53:39,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 22:53:39,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 22:53:39,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 22:53:39,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-16 22:53:39,705 INFO L87 Difference]: Start difference. First operand 1849 states and 2721 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-16 22:53:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:53:46,989 INFO L93 Difference]: Finished difference Result 5766 states and 8977 transitions. [2021-11-16 22:53:46,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-16 22:53:46,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 77 [2021-11-16 22:53:46,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:53:47,010 INFO L225 Difference]: With dead ends: 5766 [2021-11-16 22:53:47,010 INFO L226 Difference]: Without dead ends: 5764 [2021-11-16 22:53:47,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2021-11-16 22:53:47,013 INFO L933 BasicCegarLoop]: 3277 mSDtfsCounter, 4697 mSDsluCounter, 9683 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 1436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4839 SdHoareTripleChecker+Valid, 12960 SdHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1436 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-11-16 22:53:47,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4839 Valid, 12960 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1436 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2021-11-16 22:53:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5764 states. [2021-11-16 22:53:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5764 to 1853. [2021-11-16 22:53:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1368 states have (on average 1.4166666666666667) internal successors, (1938), 1414 states have internal predecessors, (1938), 394 states have call successors, (394), 89 states have call predecessors, (394), 90 states have return successors, (395), 390 states have call predecessors, (395), 394 states have call successors, (395) [2021-11-16 22:53:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2727 transitions. [2021-11-16 22:53:47,153 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2727 transitions. Word has length 77 [2021-11-16 22:53:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:53:47,154 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 2727 transitions. [2021-11-16 22:53:47,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-16 22:53:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2727 transitions. [2021-11-16 22:53:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-16 22:53:47,157 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:53:47,157 INFO L514 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:53:47,169 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-16 22:53:47,373 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-16 22:53:47,375 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:53:47,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:53:47,376 INFO L85 PathProgramCache]: Analyzing trace with hash 100126375, now seen corresponding path program 1 times [2021-11-16 22:53:47,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:53:47,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507580199] [2021-11-16 22:53:47,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:53:47,377 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:53:47,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:53:47,377 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-16 22:53:47,382 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-16 22:53:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:53:47,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-16 22:53:47,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:53:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 22:53:48,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:53:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-16 22:53:48,923 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 22:53:48,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507580199] [2021-11-16 22:53:48,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507580199] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 22:53:48,924 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:53:48,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-16 22:53:48,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103352350] [2021-11-16 22:53:48,924 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 22:53:48,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-16 22:53:48,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 22:53:48,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-16 22:53:48,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 22:53:48,925 INFO L87 Difference]: Start difference. First operand 1853 states and 2727 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-16 22:53:49,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:53:49,257 INFO L93 Difference]: Finished difference Result 1855 states and 2728 transitions. [2021-11-16 22:53:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-16 22:53:49,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 107 [2021-11-16 22:53:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:53:49,269 INFO L225 Difference]: With dead ends: 1855 [2021-11-16 22:53:49,269 INFO L226 Difference]: Without dead ends: 962 [2021-11-16 22:53:49,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 22:53:49,272 INFO L933 BasicCegarLoop]: 1369 mSDtfsCounter, 1310 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-16 22:53:49,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1310 Valid, 1401 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-16 22:53:49,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-11-16 22:53:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2021-11-16 22:53:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 710 states have (on average 1.4070422535211267) internal successors, (999), 734 states have internal predecessors, (999), 203 states have call successors, (203), 47 states have call predecessors, (203), 48 states have return successors, (204), 201 states have call predecessors, (204), 203 states have call successors, (204) [2021-11-16 22:53:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1406 transitions. [2021-11-16 22:53:49,319 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1406 transitions. Word has length 107 [2021-11-16 22:53:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:53:49,320 INFO L470 AbstractCegarLoop]: Abstraction has 962 states and 1406 transitions. [2021-11-16 22:53:49,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-16 22:53:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1406 transitions. [2021-11-16 22:53:49,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-16 22:53:49,322 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:53:49,323 INFO L514 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:53:49,338 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-16 22:53:49,534 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-16 22:53:49,535 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:53:49,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:53:49,535 INFO L85 PathProgramCache]: Analyzing trace with hash -94563103, now seen corresponding path program 1 times [2021-11-16 22:53:49,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:53:49,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070463875] [2021-11-16 22:53:49,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:53:49,536 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:53:49,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:53:49,537 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-16 22:53:49,539 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-16 22:53:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:53:49,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 22:53:49,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:53:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:53:50,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:53:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-16 22:53:51,505 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 22:53:51,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070463875] [2021-11-16 22:53:51,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070463875] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 22:53:51,505 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:53:51,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2021-11-16 22:53:51,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103249658] [2021-11-16 22:53:51,505 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 22:53:51,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 22:53:51,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 22:53:51,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 22:53:51,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:53:51,506 INFO L87 Difference]: Start difference. First operand 962 states and 1406 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 4 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 22:54:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:54:00,237 INFO L93 Difference]: Finished difference Result 2912 states and 4407 transitions. [2021-11-16 22:54:00,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:54:00,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 4 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 109 [2021-11-16 22:54:00,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:54:00,245 INFO L225 Difference]: With dead ends: 2912 [2021-11-16 22:54:00,245 INFO L226 Difference]: Without dead ends: 1991 [2021-11-16 22:54:00,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-16 22:54:00,248 INFO L933 BasicCegarLoop]: 1975 mSDtfsCounter, 3446 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 834 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3584 SdHoareTripleChecker+Valid, 4369 SdHoareTripleChecker+Invalid, 2330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 834 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2021-11-16 22:54:00,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3584 Valid, 4369 Invalid, 2330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [834 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2021-11-16 22:54:00,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2021-11-16 22:54:00,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 967. [2021-11-16 22:54:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 715 states have (on average 1.4055944055944056) internal successors, (1005), 739 states have internal predecessors, (1005), 203 states have call successors, (203), 47 states have call predecessors, (203), 48 states have return successors, (204), 201 states have call predecessors, (204), 203 states have call successors, (204) [2021-11-16 22:54:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1412 transitions. [2021-11-16 22:54:00,302 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1412 transitions. Word has length 109 [2021-11-16 22:54:00,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:54:00,303 INFO L470 AbstractCegarLoop]: Abstraction has 967 states and 1412 transitions. [2021-11-16 22:54:00,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 4 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 22:54:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1412 transitions. [2021-11-16 22:54:00,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-16 22:54:00,306 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:54:00,306 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:54:00,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-16 22:54:00,517 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-16 22:54:00,517 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:54:00,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:54:00,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1574634689, now seen corresponding path program 1 times [2021-11-16 22:54:00,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:54:00,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899460783] [2021-11-16 22:54:00,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:54:00,518 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:54:00,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:54:00,519 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-16 22:54:00,521 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-16 22:54:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:54:00,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-16 22:54:00,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:54:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 22:54:01,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:54:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-16 22:54:02,900 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 22:54:02,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899460783] [2021-11-16 22:54:02,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899460783] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 22:54:02,900 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 22:54:02,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2021-11-16 22:54:02,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776739791] [2021-11-16 22:54:02,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 22:54:02,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 22:54:02,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 22:54:02,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 22:54:02,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-16 22:54:02,902 INFO L87 Difference]: Start difference. First operand 967 states and 1412 transitions. Second operand has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 4 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 22:54:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:54:31,589 INFO L93 Difference]: Finished difference Result 5021 states and 7753 transitions. [2021-11-16 22:54:31,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 22:54:31,590 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 4 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 115 [2021-11-16 22:54:31,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:54:31,603 INFO L225 Difference]: With dead ends: 5021 [2021-11-16 22:54:31,604 INFO L226 Difference]: Without dead ends: 4095 [2021-11-16 22:54:31,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2021-11-16 22:54:31,607 INFO L933 BasicCegarLoop]: 3307 mSDtfsCounter, 7178 mSDsluCounter, 7678 mSDsCounter, 0 mSdLazyCounter, 5157 mSolverCounterSat, 1719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7592 SdHoareTripleChecker+Valid, 10985 SdHoareTripleChecker+Invalid, 6876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1719 IncrementalHoareTripleChecker+Valid, 5157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2021-11-16 22:54:31,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7592 Valid, 10985 Invalid, 6876 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1719 Valid, 5157 Invalid, 0 Unknown, 0 Unchecked, 27.9s Time] [2021-11-16 22:54:31,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2021-11-16 22:54:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 979. [2021-11-16 22:54:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 727 states have (on average 1.404401650618982) internal successors, (1021), 751 states have internal predecessors, (1021), 203 states have call successors, (203), 47 states have call predecessors, (203), 48 states have return successors, (204), 201 states have call predecessors, (204), 203 states have call successors, (204) [2021-11-16 22:54:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1428 transitions. [2021-11-16 22:54:31,675 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1428 transitions. Word has length 115 [2021-11-16 22:54:31,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:54:31,675 INFO L470 AbstractCegarLoop]: Abstraction has 979 states and 1428 transitions. [2021-11-16 22:54:31,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 4 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 22:54:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1428 transitions. [2021-11-16 22:54:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-16 22:54:31,683 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:54:31,684 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 22:54:31,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-11-16 22:54:31,899 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-16 22:54:31,899 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:54:31,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:54:31,900 INFO L85 PathProgramCache]: Analyzing trace with hash 720371343, now seen corresponding path program 1 times [2021-11-16 22:54:31,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:54:31,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298035442] [2021-11-16 22:54:31,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:54:31,901 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:54:31,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:54:31,901 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-16 22:54:31,902 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-16 22:54:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:54:32,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-16 22:54:32,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:54:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-16 22:54:32,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:54:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-16 22:54:32,932 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 22:54:32,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298035442] [2021-11-16 22:54:32,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298035442] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 22:54:32,932 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:54:32,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-16 22:54:32,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003859369] [2021-11-16 22:54:32,932 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 22:54:32,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 22:54:32,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 22:54:32,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 22:54:32,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 22:54:32,933 INFO L87 Difference]: Start difference. First operand 979 states and 1428 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-16 22:54:34,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:54:34,534 INFO L93 Difference]: Finished difference Result 3083 states and 4672 transitions. [2021-11-16 22:54:34,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 22:54:34,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 121 [2021-11-16 22:54:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:54:34,543 INFO L225 Difference]: With dead ends: 3083 [2021-11-16 22:54:34,543 INFO L226 Difference]: Without dead ends: 2145 [2021-11-16 22:54:34,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-16 22:54:34,545 INFO L933 BasicCegarLoop]: 2212 mSDtfsCounter, 2769 mSDsluCounter, 4331 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2987 SdHoareTripleChecker+Valid, 6543 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-16 22:54:34,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2987 Valid, 6543 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-16 22:54:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2021-11-16 22:54:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 981. [2021-11-16 22:54:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 729 states have (on average 1.4032921810699588) internal successors, (1023), 753 states have internal predecessors, (1023), 203 states have call successors, (203), 47 states have call predecessors, (203), 48 states have return successors, (204), 201 states have call predecessors, (204), 203 states have call successors, (204) [2021-11-16 22:54:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1430 transitions. [2021-11-16 22:54:34,603 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1430 transitions. Word has length 121 [2021-11-16 22:54:34,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:54:34,603 INFO L470 AbstractCegarLoop]: Abstraction has 981 states and 1430 transitions. [2021-11-16 22:54:34,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-16 22:54:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1430 transitions. [2021-11-16 22:54:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-16 22:54:34,606 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:54:34,606 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 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-16 22:54:34,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-11-16 22:54:34,818 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-16 22:54:34,820 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:54:34,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:54:34,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1313702370, now seen corresponding path program 1 times [2021-11-16 22:54:34,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:54:34,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703647417] [2021-11-16 22:54:34,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:54:34,822 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:54:34,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:54:34,823 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-16 22:54:34,823 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-16 22:54:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:54:35,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-16 22:54:35,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:54:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-16 22:54:35,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:54:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-16 22:54:35,861 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 22:54:35,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703647417] [2021-11-16 22:54:35,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703647417] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 22:54:35,861 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:54:35,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-16 22:54:35,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780716281] [2021-11-16 22:54:35,861 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 22:54:35,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-16 22:54:35,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 22:54:35,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-16 22:54:35,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 22:54:35,863 INFO L87 Difference]: Start difference. First operand 981 states and 1430 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 22:54:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:54:36,129 INFO L93 Difference]: Finished difference Result 2333 states and 3471 transitions. [2021-11-16 22:54:36,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-16 22:54:36,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 130 [2021-11-16 22:54:36,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:54:36,146 INFO L225 Difference]: With dead ends: 2333 [2021-11-16 22:54:36,146 INFO L226 Difference]: Without dead ends: 1393 [2021-11-16 22:54:36,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 22:54:36,149 INFO L933 BasicCegarLoop]: 1996 mSDtfsCounter, 420 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 3452 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 22:54:36,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 3452 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 22:54:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2021-11-16 22:54:36,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 983. [2021-11-16 22:54:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 731 states have (on average 1.40218878248974) internal successors, (1025), 755 states have internal predecessors, (1025), 203 states have call successors, (203), 47 states have call predecessors, (203), 48 states have return successors, (204), 201 states have call predecessors, (204), 203 states have call successors, (204) [2021-11-16 22:54:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1432 transitions. [2021-11-16 22:54:36,217 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1432 transitions. Word has length 130 [2021-11-16 22:54:36,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:54:36,217 INFO L470 AbstractCegarLoop]: Abstraction has 983 states and 1432 transitions. [2021-11-16 22:54:36,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 22:54:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1432 transitions. [2021-11-16 22:54:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-16 22:54:36,221 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:54:36,221 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-16 22:54:36,237 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-16 22:54:36,440 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-16 22:54:36,440 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:54:36,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:54:36,441 INFO L85 PathProgramCache]: Analyzing trace with hash -584513274, now seen corresponding path program 1 times [2021-11-16 22:54:36,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:54:36,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468552478] [2021-11-16 22:54:36,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:54:36,441 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:54:36,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:54:36,443 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-16 22:54:36,444 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-16 22:54:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:54:36,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-16 22:54:36,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:54:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-16 22:54:37,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:54:38,297 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-16 22:54:38,297 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 22:54:38,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468552478] [2021-11-16 22:54:38,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468552478] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 22:54:38,297 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:54:38,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-11-16 22:54:38,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107634830] [2021-11-16 22:54:38,298 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 22:54:38,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 22:54:38,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 22:54:38,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 22:54:38,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-16 22:54:38,299 INFO L87 Difference]: Start difference. First operand 983 states and 1432 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 8 states have internal predecessors, (118), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-16 22:54:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:54:40,742 INFO L93 Difference]: Finished difference Result 3301 states and 5000 transitions. [2021-11-16 22:54:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 22:54:40,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 8 states have internal predecessors, (118), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) Word has length 138 [2021-11-16 22:54:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:54:40,750 INFO L225 Difference]: With dead ends: 3301 [2021-11-16 22:54:40,750 INFO L226 Difference]: Without dead ends: 2359 [2021-11-16 22:54:40,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-11-16 22:54:40,754 INFO L933 BasicCegarLoop]: 2686 mSDtfsCounter, 1796 mSDsluCounter, 17073 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2048 SdHoareTripleChecker+Valid, 19759 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-16 22:54:40,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2048 Valid, 19759 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-16 22:54:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2021-11-16 22:54:40,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 988. [2021-11-16 22:54:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 735 states have (on average 1.4) internal successors, (1029), 759 states have internal predecessors, (1029), 203 states have call successors, (203), 47 states have call predecessors, (203), 49 states have return successors, (208), 202 states have call predecessors, (208), 203 states have call successors, (208) [2021-11-16 22:54:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1440 transitions. [2021-11-16 22:54:40,856 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1440 transitions. Word has length 138 [2021-11-16 22:54:40,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:54:40,856 INFO L470 AbstractCegarLoop]: Abstraction has 988 states and 1440 transitions. [2021-11-16 22:54:40,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 8 states have internal predecessors, (118), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-16 22:54:40,857 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1440 transitions. [2021-11-16 22:54:40,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-16 22:54:40,861 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:54:40,861 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 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-16 22:54:40,877 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-16 22:54:41,067 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-16 22:54:41,067 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:54:41,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:54:41,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1623663578, now seen corresponding path program 2 times [2021-11-16 22:54:41,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:54:41,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124525334] [2021-11-16 22:54:41,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 22:54:41,069 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:54:41,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:54:41,070 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-16 22:54:41,070 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-16 22:54:41,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-16 22:54:41,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 22:54:41,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-16 22:54:41,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:54:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-16 22:54:41,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 22:54:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-16 22:54:41,887 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 22:54:41,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124525334] [2021-11-16 22:54:41,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124525334] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 22:54:41,888 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 22:54:41,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-16 22:54:41,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240490588] [2021-11-16 22:54:41,888 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 22:54:41,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-16 22:54:41,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 22:54:41,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-16 22:54:41,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 22:54:41,889 INFO L87 Difference]: Start difference. First operand 988 states and 1440 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-16 22:54:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 22:54:41,995 INFO L93 Difference]: Finished difference Result 1936 states and 2844 transitions. [2021-11-16 22:54:41,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-16 22:54:41,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2021-11-16 22:54:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 22:54:41,998 INFO L225 Difference]: With dead ends: 1936 [2021-11-16 22:54:41,998 INFO L226 Difference]: Without dead ends: 989 [2021-11-16 22:54:42,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 22:54:42,000 INFO L933 BasicCegarLoop]: 1359 mSDtfsCounter, 0 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 22:54:42,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2711 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 22:54:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-11-16 22:54:42,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 988. [2021-11-16 22:54:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 735 states have (on average 1.3959183673469389) internal successors, (1026), 759 states have internal predecessors, (1026), 203 states have call successors, (203), 47 states have call predecessors, (203), 49 states have return successors, (208), 202 states have call predecessors, (208), 203 states have call successors, (208) [2021-11-16 22:54:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1437 transitions. [2021-11-16 22:54:42,058 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1437 transitions. Word has length 141 [2021-11-16 22:54:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 22:54:42,058 INFO L470 AbstractCegarLoop]: Abstraction has 988 states and 1437 transitions. [2021-11-16 22:54:42,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-16 22:54:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1437 transitions. [2021-11-16 22:54:42,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-16 22:54:42,062 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 22:54:42,062 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-16 22:54:42,073 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-16 22:54:42,268 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-16 22:54:42,269 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 22:54:42,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 22:54:42,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1010266095, now seen corresponding path program 1 times [2021-11-16 22:54:42,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 22:54:42,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787922693] [2021-11-16 22:54:42,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 22:54:42,270 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 22:54:42,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 22:54:42,271 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-16 22:54:42,272 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-16 22:54:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 22:54:46,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 91 conjunts are in the unsatisfiable core [2021-11-16 22:54:46,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 22:54:46,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-16 22:54:50,216 INFO L354 Elim1Store]: treesize reduction 161, result has 16.6 percent of original size [2021-11-16 22:54:50,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 68 [2021-11-16 22:54:51,673 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-16 22:54:51,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 33 [2021-11-16 22:54:52,819 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-11-16 22:54:52,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 59 [2021-11-16 22:54:53,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:54:53,860 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-16 22:54:53,861 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-16 22:54:58,185 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-16 22:54:58,207 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-16 22:54:58,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:54:58,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:54:58,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:54:58,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:54:58,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:54:58,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:54:58,372 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-16 22:55:00,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:00,792 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-16 22:55:00,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:00,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:00,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:00,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:00,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:00,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:00,855 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-16 22:55:00,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:00,973 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-16 22:55:06,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:06,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:06,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:06,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:06,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:06,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:06,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,090 INFO L244 Elim1Store]: Index analysis took 131 ms [2021-11-16 22:55:07,093 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-16 22:55:07,205 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-16 22:55:07,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,272 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-16 22:55:07,372 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-16 22:55:07,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:07,427 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-16 22:55:15,079 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 318 treesize of output 292 [2021-11-16 22:55:15,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,159 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 275 treesize of output 292 [2021-11-16 22:55:15,185 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 277 treesize of output 251 [2021-11-16 22:55:15,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,256 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 234 treesize of output 251 [2021-11-16 22:55:15,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,532 INFO L354 Elim1Store]: treesize reduction 120, result has 18.9 percent of original size [2021-11-16 22:55:15,533 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 227 treesize of output 232 [2021-11-16 22:55:15,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,821 INFO L354 Elim1Store]: treesize reduction 126, result has 18.2 percent of original size [2021-11-16 22:55:15,822 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 223 treesize of output 228 [2021-11-16 22:55:15,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:15,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:16,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:16,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:16,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:16,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:16,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:16,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:16,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:16,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:16,575 INFO L354 Elim1Store]: treesize reduction 435, result has 16.5 percent of original size [2021-11-16 22:55:16,576 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 236 treesize of output 210 [2021-11-16 22:55:21,396 INFO L354 Elim1Store]: treesize reduction 616, result has 10.2 percent of original size [2021-11-16 22:55:21,396 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 663 treesize of output 489 [2021-11-16 22:55:22,109 INFO L354 Elim1Store]: treesize reduction 376, result has 10.3 percent of original size [2021-11-16 22:55:22,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 434 treesize of output 245 [2021-11-16 22:55:23,425 INFO L354 Elim1Store]: treesize reduction 824, result has 10.6 percent of original size [2021-11-16 22:55:23,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 37 case distinctions, treesize of input 310 treesize of output 304 [2021-11-16 22:55:43,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,565 INFO L354 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2021-11-16 22:55:43,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 36 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 605 treesize of output 649 [2021-11-16 22:55:43,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:55:43,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-16 22:56:22,318 WARN L227 SmtUtils]: Spent 38.65s on a formula simplification. DAG size of input: 265 DAG size of output: 58 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-16 22:56:22,318 INFO L354 Elim1Store]: treesize reduction 742, result has 11.8 percent of original size [2021-11-16 22:56:22,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 10 disjoint index pairs (out of 66 index pairs), introduced 15 new quantified variables, introduced 70 case distinctions, treesize of input 592 treesize of output 496 [2021-11-16 22:56:22,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:56:22,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:56:22,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:56:22,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:56:22,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:56:22,388 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-16 22:56:22,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:56:22,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:56:22,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 22:56:26,130 INFO L354 Elim1Store]: treesize reduction 827, result has 8.2 percent of original size [2021-11-16 22:56:26,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 10 disjoint index pairs (out of 66 index pairs), introduced 13 new quantified variables, introduced 70 case distinctions, treesize of input 488 treesize of output 525 Killed by 15