./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3a877d22 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/forester-heap/sll-01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 10:45:01,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 10:45:01,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 10:45:02,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 10:45:02,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 10:45:02,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 10:45:02,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 10:45:02,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 10:45:02,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 10:45:02,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 10:45:02,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 10:45:02,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 10:45:02,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 10:45:02,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 10:45:02,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 10:45:02,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 10:45:02,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 10:45:02,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 10:45:02,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 10:45:02,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 10:45:02,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 10:45:02,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 10:45:02,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 10:45:02,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 10:45:02,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 10:45:02,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 10:45:02,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 10:45:02,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 10:45:02,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 10:45:02,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 10:45:02,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 10:45:02,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 10:45:02,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 10:45:02,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 10:45:02,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 10:45:02,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 10:45:02,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 10:45:02,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 10:45:02,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 10:45:02,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 10:45:02,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 10:45:02,081 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 10:45:02,109 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 10:45:02,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 10:45:02,110 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 10:45:02,110 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 10:45:02,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 10:45:02,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 10:45:02,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 10:45:02,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 10:45:02,112 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 10:45:02,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 10:45:02,113 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 10:45:02,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 10:45:02,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 10:45:02,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 10:45:02,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 10:45:02,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 10:45:02,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 10:45:02,114 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 10:45:02,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 10:45:02,114 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 10:45:02,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 10:45:02,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 10:45:02,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 10:45:02,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 10:45:02,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:45:02,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 10:45:02,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 10:45:02,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 10:45:02,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 10:45:02,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 10:45:02,117 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 10:45:02,117 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 10:45:02,118 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 10:45:02,118 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 10:45:02,118 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2021-12-15 10:45:02,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 10:45:02,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 10:45:02,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 10:45:02,333 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 10:45:02,333 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 10:45:02,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2021-12-15 10:45:02,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/408e3e540/15d8036bbda946c98386da7146b43ad3/FLAGc0eba9ba9 [2021-12-15 10:45:02,749 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 10:45:02,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2021-12-15 10:45:02,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/408e3e540/15d8036bbda946c98386da7146b43ad3/FLAGc0eba9ba9 [2021-12-15 10:45:03,163 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/408e3e540/15d8036bbda946c98386da7146b43ad3 [2021-12-15 10:45:03,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 10:45:03,166 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 10:45:03,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 10:45:03,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 10:45:03,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 10:45:03,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:45:03" (1/1) ... [2021-12-15 10:45:03,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a35c01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:03, skipping insertion in model container [2021-12-15 10:45:03,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:45:03" (1/1) ... [2021-12-15 10:45:03,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 10:45:03,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 10:45:03,403 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/forester-heap/sll-01-2.i[22034,22047] [2021-12-15 10:45:03,409 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/forester-heap/sll-01-2.i[22307,22320] [2021-12-15 10:45:03,414 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/forester-heap/sll-01-2.i[22516,22529] [2021-12-15 10:45:03,415 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/forester-heap/sll-01-2.i[22586,22599] [2021-12-15 10:45:03,417 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/forester-heap/sll-01-2.i[22853,22866] [2021-12-15 10:45:03,420 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/forester-heap/sll-01-2.i[22961,22974] [2021-12-15 10:45:03,423 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/forester-heap/sll-01-2.i[23192,23205] [2021-12-15 10:45:03,424 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/forester-heap/sll-01-2.i[23272,23285] [2021-12-15 10:45:03,426 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/forester-heap/sll-01-2.i[23351,23364] [2021-12-15 10:45:03,427 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/forester-heap/sll-01-2.i[23484,23497] [2021-12-15 10:45:03,428 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/forester-heap/sll-01-2.i[23662,23675] [2021-12-15 10:45:03,429 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/forester-heap/sll-01-2.i[23740,23753] [2021-12-15 10:45:03,431 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/forester-heap/sll-01-2.i[23817,23830] [2021-12-15 10:45:03,433 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:45:03,443 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 10:45:03,476 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/forester-heap/sll-01-2.i[22034,22047] [2021-12-15 10:45:03,477 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/forester-heap/sll-01-2.i[22307,22320] [2021-12-15 10:45:03,478 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/forester-heap/sll-01-2.i[22516,22529] [2021-12-15 10:45:03,479 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/forester-heap/sll-01-2.i[22586,22599] [2021-12-15 10:45:03,486 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/forester-heap/sll-01-2.i[22853,22866] [2021-12-15 10:45:03,487 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/forester-heap/sll-01-2.i[22961,22974] [2021-12-15 10:45:03,488 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/forester-heap/sll-01-2.i[23192,23205] [2021-12-15 10:45:03,488 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/forester-heap/sll-01-2.i[23272,23285] [2021-12-15 10:45:03,489 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/forester-heap/sll-01-2.i[23351,23364] [2021-12-15 10:45:03,490 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/forester-heap/sll-01-2.i[23484,23497] [2021-12-15 10:45:03,491 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/forester-heap/sll-01-2.i[23662,23675] [2021-12-15 10:45:03,491 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/forester-heap/sll-01-2.i[23740,23753] [2021-12-15 10:45:03,492 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/forester-heap/sll-01-2.i[23817,23830] [2021-12-15 10:45:03,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:45:03,509 INFO L208 MainTranslator]: Completed translation [2021-12-15 10:45:03,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:03 WrapperNode [2021-12-15 10:45:03,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 10:45:03,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 10:45:03,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 10:45:03,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 10:45:03,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:03" (1/1) ... [2021-12-15 10:45:03,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:03" (1/1) ... [2021-12-15 10:45:03,566 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 225 [2021-12-15 10:45:03,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 10:45:03,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 10:45:03,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 10:45:03,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 10:45:03,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:03" (1/1) ... [2021-12-15 10:45:03,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:03" (1/1) ... [2021-12-15 10:45:03,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:03" (1/1) ... [2021-12-15 10:45:03,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:03" (1/1) ... [2021-12-15 10:45:03,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:03" (1/1) ... [2021-12-15 10:45:03,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:03" (1/1) ... [2021-12-15 10:45:03,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:03" (1/1) ... [2021-12-15 10:45:03,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 10:45:03,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 10:45:03,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 10:45:03,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 10:45:03,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:03" (1/1) ... [2021-12-15 10:45:03,629 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:45:03,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:03,651 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-12-15 10:45:03,653 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-12-15 10:45:03,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 10:45:03,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 10:45:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 10:45:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 10:45:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 10:45:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 10:45:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 10:45:03,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 10:45:03,753 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 10:45:03,754 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 10:45:03,959 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 10:45:03,964 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 10:45:03,965 INFO L301 CfgBuilder]: Removed 30 assume(true) statements. [2021-12-15 10:45:03,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:45:03 BoogieIcfgContainer [2021-12-15 10:45:03,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 10:45:03,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 10:45:03,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 10:45:03,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 10:45:03,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:45:03" (1/3) ... [2021-12-15 10:45:03,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6271ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:45:03, skipping insertion in model container [2021-12-15 10:45:03,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:03" (2/3) ... [2021-12-15 10:45:03,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6271ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:45:03, skipping insertion in model container [2021-12-15 10:45:03,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:45:03" (3/3) ... [2021-12-15 10:45:03,972 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2021-12-15 10:45:03,975 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 10:45:03,975 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2021-12-15 10:45:04,005 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 10:45:04,009 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-12-15 10:45:04,010 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2021-12-15 10:45:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 70 states have (on average 1.957142857142857) internal successors, (137), 83 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-15 10:45:04,043 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:04,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-15 10:45:04,044 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:04,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:04,047 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2021-12-15 10:45:04,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:04,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711828714] [2021-12-15 10:45:04,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:04,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:04,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:04,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711828714] [2021-12-15 10:45:04,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711828714] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:04,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:04,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:45:04,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142190472] [2021-12-15 10:45:04,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:04,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:45:04,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:04,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:45:04,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:45:04,228 INFO L87 Difference]: Start difference. First operand has 84 states, 70 states have (on average 1.957142857142857) internal successors, (137), 83 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:04,285 INFO L93 Difference]: Finished difference Result 182 states and 300 transitions. [2021-12-15 10:45:04,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:45:04,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-15 10:45:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:04,294 INFO L225 Difference]: With dead ends: 182 [2021-12-15 10:45:04,294 INFO L226 Difference]: Without dead ends: 96 [2021-12-15 10:45:04,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-15 10:45:04,299 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 85 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:04,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 104 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:45:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-15 10:45:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2021-12-15 10:45:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2021-12-15 10:45:04,336 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 4 [2021-12-15 10:45:04,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:04,338 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2021-12-15 10:45:04,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2021-12-15 10:45:04,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 10:45:04,340 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:04,340 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:04,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 10:45:04,341 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:04,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:04,343 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2021-12-15 10:45:04,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:04,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727414980] [2021-12-15 10:45:04,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:04,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:04,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:04,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727414980] [2021-12-15 10:45:04,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727414980] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:04,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:04,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:45:04,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647454073] [2021-12-15 10:45:04,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:04,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:45:04,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:04,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:45:04,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:45:04,411 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:04,443 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2021-12-15 10:45:04,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:45:04,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 10:45:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:04,447 INFO L225 Difference]: With dead ends: 81 [2021-12-15 10:45:04,448 INFO L226 Difference]: Without dead ends: 79 [2021-12-15 10:45:04,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-15 10:45:04,450 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:04,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:45:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-15 10:45:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-12-15 10:45:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.328358208955224) internal successors, (89), 78 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2021-12-15 10:45:04,460 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 10 [2021-12-15 10:45:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:04,461 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2021-12-15 10:45:04,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,461 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2021-12-15 10:45:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 10:45:04,478 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:04,478 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:04,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 10:45:04,480 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:04,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:04,481 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2021-12-15 10:45:04,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:04,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4861845] [2021-12-15 10:45:04,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:04,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:04,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:04,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4861845] [2021-12-15 10:45:04,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4861845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:04,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:04,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:45:04,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982997299] [2021-12-15 10:45:04,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:04,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:45:04,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:04,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:45:04,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:45:04,578 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:04,642 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2021-12-15 10:45:04,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:45:04,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 10:45:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:04,643 INFO L225 Difference]: With dead ends: 80 [2021-12-15 10:45:04,643 INFO L226 Difference]: Without dead ends: 78 [2021-12-15 10:45:04,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-15 10:45:04,645 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:04,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 144 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:45:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-15 10:45:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2021-12-15 10:45:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.323076923076923) internal successors, (86), 75 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2021-12-15 10:45:04,650 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 10 [2021-12-15 10:45:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:04,650 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2021-12-15 10:45:04,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2021-12-15 10:45:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 10:45:04,651 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:04,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:04,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 10:45:04,651 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:04,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2021-12-15 10:45:04,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:04,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767430877] [2021-12-15 10:45:04,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:04,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:04,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:04,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767430877] [2021-12-15 10:45:04,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767430877] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:04,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:04,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:45:04,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536076554] [2021-12-15 10:45:04,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:04,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:45:04,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:04,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:45:04,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:45:04,707 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:04,748 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2021-12-15 10:45:04,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:45:04,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 10:45:04,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:04,751 INFO L225 Difference]: With dead ends: 79 [2021-12-15 10:45:04,751 INFO L226 Difference]: Without dead ends: 75 [2021-12-15 10:45:04,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-15 10:45:04,753 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 16 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:04,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 129 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:45:04,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-15 10:45:04,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2021-12-15 10:45:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2021-12-15 10:45:04,764 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 15 [2021-12-15 10:45:04,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:04,765 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2021-12-15 10:45:04,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2021-12-15 10:45:04,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 10:45:04,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:04,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:04,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 10:45:04,766 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:04,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:04,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2021-12-15 10:45:04,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:04,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428286896] [2021-12-15 10:45:04,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:04,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:04,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:04,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428286896] [2021-12-15 10:45:04,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428286896] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:04,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:04,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:45:04,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170950324] [2021-12-15 10:45:04,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:04,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:45:04,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:04,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:45:04,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:45:04,830 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:04,913 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2021-12-15 10:45:04,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:45:04,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 10:45:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:04,914 INFO L225 Difference]: With dead ends: 190 [2021-12-15 10:45:04,914 INFO L226 Difference]: Without dead ends: 126 [2021-12-15 10:45:04,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-15 10:45:04,915 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 57 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:04,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 190 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:45:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-15 10:45:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2021-12-15 10:45:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 73 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2021-12-15 10:45:04,920 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 16 [2021-12-15 10:45:04,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:04,920 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2021-12-15 10:45:04,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2021-12-15 10:45:04,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 10:45:04,921 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:04,921 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:04,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 10:45:04,922 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:04,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:04,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2021-12-15 10:45:04,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:04,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032846223] [2021-12-15 10:45:04,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:04,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:04,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:04,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032846223] [2021-12-15 10:45:04,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032846223] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:04,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:04,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:45:04,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366926399] [2021-12-15 10:45:04,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:04,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:45:04,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:04,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:45:04,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:45:04,956 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:05,010 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2021-12-15 10:45:05,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:45:05,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 10:45:05,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:05,011 INFO L225 Difference]: With dead ends: 134 [2021-12-15 10:45:05,012 INFO L226 Difference]: Without dead ends: 114 [2021-12-15 10:45:05,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-15 10:45:05,012 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 134 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:05,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 120 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:45:05,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-15 10:45:05,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 73. [2021-12-15 10:45:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2021-12-15 10:45:05,019 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 16 [2021-12-15 10:45:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:05,020 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2021-12-15 10:45:05,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2021-12-15 10:45:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 10:45:05,020 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:05,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:05,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 10:45:05,021 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:05,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:05,021 INFO L85 PathProgramCache]: Analyzing trace with hash -940628020, now seen corresponding path program 1 times [2021-12-15 10:45:05,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:05,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431033375] [2021-12-15 10:45:05,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:05,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:05,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:05,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:05,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431033375] [2021-12-15 10:45:05,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431033375] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:05,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:05,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:45:05,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128296742] [2021-12-15 10:45:05,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:05,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:45:05,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:05,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:45:05,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:45:05,048 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:05,057 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2021-12-15 10:45:05,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:45:05,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-15 10:45:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:05,058 INFO L225 Difference]: With dead ends: 139 [2021-12-15 10:45:05,058 INFO L226 Difference]: Without dead ends: 97 [2021-12-15 10:45:05,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-15 10:45:05,059 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:05,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 151 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:45:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-15 10:45:05,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2021-12-15 10:45:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 75 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2021-12-15 10:45:05,063 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 20 [2021-12-15 10:45:05,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:05,063 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2021-12-15 10:45:05,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,063 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2021-12-15 10:45:05,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 10:45:05,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:05,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:05,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 10:45:05,064 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:05,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2021-12-15 10:45:05,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:05,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705745650] [2021-12-15 10:45:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:05,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:05,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:05,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705745650] [2021-12-15 10:45:05,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705745650] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:05,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:05,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:45:05,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349024670] [2021-12-15 10:45:05,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:05,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:45:05,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:05,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:45:05,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:45:05,092 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:05,101 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2021-12-15 10:45:05,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:45:05,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-15 10:45:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:05,102 INFO L225 Difference]: With dead ends: 76 [2021-12-15 10:45:05,102 INFO L226 Difference]: Without dead ends: 74 [2021-12-15 10:45:05,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-15 10:45:05,103 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:05,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 132 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:45:05,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-15 10:45:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-12-15 10:45:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 73 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2021-12-15 10:45:05,107 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 21 [2021-12-15 10:45:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:05,107 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2021-12-15 10:45:05,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2021-12-15 10:45:05,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 10:45:05,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:05,108 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:05,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 10:45:05,108 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:05,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:05,109 INFO L85 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2021-12-15 10:45:05,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:05,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255086781] [2021-12-15 10:45:05,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:05,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:05,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:05,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255086781] [2021-12-15 10:45:05,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255086781] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:05,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:05,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:45:05,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313056958] [2021-12-15 10:45:05,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:05,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:45:05,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:05,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:45:05,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:45:05,152 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:05,194 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2021-12-15 10:45:05,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:45:05,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 10:45:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:05,195 INFO L225 Difference]: With dead ends: 75 [2021-12-15 10:45:05,196 INFO L226 Difference]: Without dead ends: 73 [2021-12-15 10:45:05,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-15 10:45:05,196 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:05,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:45:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-15 10:45:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2021-12-15 10:45:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 71 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2021-12-15 10:45:05,199 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 23 [2021-12-15 10:45:05,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:05,200 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2021-12-15 10:45:05,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2021-12-15 10:45:05,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 10:45:05,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:05,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:05,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 10:45:05,201 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:05,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:05,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2021-12-15 10:45:05,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:05,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002022491] [2021-12-15 10:45:05,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:05,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:05,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:05,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002022491] [2021-12-15 10:45:05,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002022491] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:05,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:05,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 10:45:05,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769736721] [2021-12-15 10:45:05,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:05,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 10:45:05,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:05,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 10:45:05,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-15 10:45:05,273 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:05,412 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2021-12-15 10:45:05,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 10:45:05,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 10:45:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:05,415 INFO L225 Difference]: With dead ends: 178 [2021-12-15 10:45:05,415 INFO L226 Difference]: Without dead ends: 135 [2021-12-15 10:45:05,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-15 10:45:05,418 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 117 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:05,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 290 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:45:05,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-15 10:45:05,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 82. [2021-12-15 10:45:05,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.236842105263158) internal successors, (94), 81 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2021-12-15 10:45:05,422 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 24 [2021-12-15 10:45:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:05,423 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2021-12-15 10:45:05,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,423 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2021-12-15 10:45:05,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 10:45:05,426 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:05,426 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:05,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 10:45:05,427 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:05,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:05,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2021-12-15 10:45:05,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:05,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134701628] [2021-12-15 10:45:05,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:05,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:05,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:05,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134701628] [2021-12-15 10:45:05,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134701628] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:05,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:05,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 10:45:05,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394963480] [2021-12-15 10:45:05,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:05,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 10:45:05,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:05,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 10:45:05,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-15 10:45:05,574 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:05,865 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2021-12-15 10:45:05,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 10:45:05,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 10:45:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:05,868 INFO L225 Difference]: With dead ends: 237 [2021-12-15 10:45:05,868 INFO L226 Difference]: Without dead ends: 235 [2021-12-15 10:45:05,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-15 10:45:05,868 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 253 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:05,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 426 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 10:45:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-12-15 10:45:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 94. [2021-12-15 10:45:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 93 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2021-12-15 10:45:05,873 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 24 [2021-12-15 10:45:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:05,874 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2021-12-15 10:45:05,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2021-12-15 10:45:05,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 10:45:05,875 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:05,875 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:05,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 10:45:05,875 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:05,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:05,876 INFO L85 PathProgramCache]: Analyzing trace with hash -545310703, now seen corresponding path program 1 times [2021-12-15 10:45:05,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:05,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154504457] [2021-12-15 10:45:05,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:05,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:45:05,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:05,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154504457] [2021-12-15 10:45:05,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154504457] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:05,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:05,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 10:45:05,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010739766] [2021-12-15 10:45:05,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:05,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 10:45:05,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:05,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 10:45:05,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:45:05,924 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:06,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:06,001 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2021-12-15 10:45:06,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 10:45:06,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 10:45:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:06,002 INFO L225 Difference]: With dead ends: 141 [2021-12-15 10:45:06,002 INFO L226 Difference]: Without dead ends: 123 [2021-12-15 10:45:06,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-15 10:45:06,002 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 61 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:06,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 193 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:45:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-15 10:45:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2021-12-15 10:45:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 109 states have (on average 1.2568807339449541) internal successors, (137), 114 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2021-12-15 10:45:06,007 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 26 [2021-12-15 10:45:06,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:06,007 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2021-12-15 10:45:06,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2021-12-15 10:45:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 10:45:06,008 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:06,008 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:06,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 10:45:06,008 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:06,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1566334865, now seen corresponding path program 1 times [2021-12-15 10:45:06,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:06,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207081808] [2021-12-15 10:45:06,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:06,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:45:06,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:06,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207081808] [2021-12-15 10:45:06,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207081808] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:06,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:06,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:45:06,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023836701] [2021-12-15 10:45:06,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:06,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:45:06,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:06,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:45:06,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:45:06,044 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:06,075 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2021-12-15 10:45:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:45:06,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 10:45:06,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:06,077 INFO L225 Difference]: With dead ends: 115 [2021-12-15 10:45:06,077 INFO L226 Difference]: Without dead ends: 113 [2021-12-15 10:45:06,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-15 10:45:06,078 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 51 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:06,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:45:06,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-15 10:45:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-12-15 10:45:06,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.25) internal successors, (135), 112 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2021-12-15 10:45:06,082 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 26 [2021-12-15 10:45:06,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:06,082 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2021-12-15 10:45:06,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2021-12-15 10:45:06,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 10:45:06,083 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:06,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:06,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 10:45:06,084 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:06,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:06,084 INFO L85 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2021-12-15 10:45:06,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:06,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503396857] [2021-12-15 10:45:06,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:06,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:06,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:06,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503396857] [2021-12-15 10:45:06,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503396857] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:06,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:06,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 10:45:06,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058456898] [2021-12-15 10:45:06,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:06,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 10:45:06,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:06,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 10:45:06,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-15 10:45:06,227 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:06,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:06,475 INFO L93 Difference]: Finished difference Result 273 states and 318 transitions. [2021-12-15 10:45:06,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 10:45:06,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-15 10:45:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:06,476 INFO L225 Difference]: With dead ends: 273 [2021-12-15 10:45:06,476 INFO L226 Difference]: Without dead ends: 271 [2021-12-15 10:45:06,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-15 10:45:06,477 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 258 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:06,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 390 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 10:45:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-12-15 10:45:06,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 116. [2021-12-15 10:45:06,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.2432432432432432) internal successors, (138), 115 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2021-12-15 10:45:06,482 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 27 [2021-12-15 10:45:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:06,482 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2021-12-15 10:45:06,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2021-12-15 10:45:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 10:45:06,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:06,483 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:06,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 10:45:06,485 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:06,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:06,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2026653164, now seen corresponding path program 1 times [2021-12-15 10:45:06,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:06,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275937953] [2021-12-15 10:45:06,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:06,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:06,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:06,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275937953] [2021-12-15 10:45:06,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275937953] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:45:06,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082777337] [2021-12-15 10:45:06,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:06,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:06,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:06,580 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-12-15 10:45:06,593 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-12-15 10:45:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:06,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-15 10:45:06,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:45:06,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 10:45:06,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 10:45:06,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:06,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 10:45:06,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:06,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 10:45:06,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 10:45:06,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 10:45:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:06,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:45:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:07,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082777337] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:45:07,089 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:45:07,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2021-12-15 10:45:07,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578077325] [2021-12-15 10:45:07,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:45:07,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 10:45:07,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:07,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 10:45:07,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-15 10:45:07,091 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:07,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:07,235 INFO L93 Difference]: Finished difference Result 203 states and 237 transitions. [2021-12-15 10:45:07,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 10:45:07,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 10:45:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:07,236 INFO L225 Difference]: With dead ends: 203 [2021-12-15 10:45:07,236 INFO L226 Difference]: Without dead ends: 141 [2021-12-15 10:45:07,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-15 10:45:07,237 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 112 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:07,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 222 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:45:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-15 10:45:07,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2021-12-15 10:45:07,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.2212389380530972) internal successors, (138), 117 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2021-12-15 10:45:07,242 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 29 [2021-12-15 10:45:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:07,242 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2021-12-15 10:45:07,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:07,243 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2021-12-15 10:45:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 10:45:07,243 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:07,243 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:07,262 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-12-15 10:45:07,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-15 10:45:07,444 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:07,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:07,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2133518130, now seen corresponding path program 1 times [2021-12-15 10:45:07,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:07,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228123709] [2021-12-15 10:45:07,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:07,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:07,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:07,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228123709] [2021-12-15 10:45:07,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228123709] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:07,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:07,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 10:45:07,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355194655] [2021-12-15 10:45:07,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:07,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 10:45:07,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:07,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 10:45:07,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 10:45:07,602 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:07,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:07,747 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2021-12-15 10:45:07,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 10:45:07,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 10:45:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:07,748 INFO L225 Difference]: With dead ends: 161 [2021-12-15 10:45:07,748 INFO L226 Difference]: Without dead ends: 141 [2021-12-15 10:45:07,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-15 10:45:07,749 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 105 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:07,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 267 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:45:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-15 10:45:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 117. [2021-12-15 10:45:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 116 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2021-12-15 10:45:07,753 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 29 [2021-12-15 10:45:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:07,754 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2021-12-15 10:45:07,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2021-12-15 10:45:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-15 10:45:07,754 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:07,754 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:07,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 10:45:07,754 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:07,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:07,754 INFO L85 PathProgramCache]: Analyzing trace with hash 830518973, now seen corresponding path program 1 times [2021-12-15 10:45:07,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:07,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260929305] [2021-12-15 10:45:07,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:07,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:07,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:07,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260929305] [2021-12-15 10:45:07,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260929305] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:45:07,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635539522] [2021-12-15 10:45:07,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:07,867 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:07,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:07,868 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-12-15 10:45:07,869 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-12-15 10:45:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:07,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-15 10:45:07,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:45:07,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 10:45:07,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 10:45:08,007 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-15 10:45:08,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 10:45:08,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:08,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 10:45:08,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 10:45:08,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 10:45:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:45:08,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:45:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:45:08,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635539522] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:45:08,216 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:45:08,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2021-12-15 10:45:08,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502048795] [2021-12-15 10:45:08,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:45:08,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 10:45:08,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:08,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 10:45:08,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 10:45:08,218 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:08,365 INFO L93 Difference]: Finished difference Result 206 states and 233 transitions. [2021-12-15 10:45:08,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 10:45:08,365 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-15 10:45:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:08,366 INFO L225 Difference]: With dead ends: 206 [2021-12-15 10:45:08,366 INFO L226 Difference]: Without dead ends: 175 [2021-12-15 10:45:08,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-15 10:45:08,369 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 99 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:08,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 306 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:45:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-15 10:45:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 134. [2021-12-15 10:45:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.248062015503876) internal successors, (161), 133 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 161 transitions. [2021-12-15 10:45:08,374 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 161 transitions. Word has length 32 [2021-12-15 10:45:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:08,374 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 161 transitions. [2021-12-15 10:45:08,374 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 161 transitions. [2021-12-15 10:45:08,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-15 10:45:08,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:08,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:08,393 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-12-15 10:45:08,590 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,SelfDestructingSolverStorable16 [2021-12-15 10:45:08,590 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:08,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:08,591 INFO L85 PathProgramCache]: Analyzing trace with hash -60835504, now seen corresponding path program 1 times [2021-12-15 10:45:08,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:08,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534868303] [2021-12-15 10:45:08,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:08,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:08,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:08,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534868303] [2021-12-15 10:45:08,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534868303] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:08,646 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:08,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:45:08,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625532889] [2021-12-15 10:45:08,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:08,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:45:08,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:08,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:45:08,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:45:08,647 INFO L87 Difference]: Start difference. First operand 134 states and 161 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:08,673 INFO L93 Difference]: Finished difference Result 293 states and 360 transitions. [2021-12-15 10:45:08,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:45:08,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-15 10:45:08,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:08,674 INFO L225 Difference]: With dead ends: 293 [2021-12-15 10:45:08,674 INFO L226 Difference]: Without dead ends: 211 [2021-12-15 10:45:08,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-15 10:45:08,675 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:08,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 161 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:45:08,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-15 10:45:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 171. [2021-12-15 10:45:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.2469879518072289) internal successors, (207), 170 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:08,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 207 transitions. [2021-12-15 10:45:08,681 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 207 transitions. Word has length 32 [2021-12-15 10:45:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:08,681 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 207 transitions. [2021-12-15 10:45:08,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 207 transitions. [2021-12-15 10:45:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 10:45:08,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:08,681 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:08,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-15 10:45:08,682 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:08,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:08,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2021-12-15 10:45:08,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:08,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189887345] [2021-12-15 10:45:08,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:08,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:08,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:08,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189887345] [2021-12-15 10:45:08,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189887345] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:45:08,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351236679] [2021-12-15 10:45:08,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:08,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:08,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:08,860 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-12-15 10:45:08,861 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-12-15 10:45:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:08,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-15 10:45:08,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:45:08,962 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-12-15 10:45:08,980 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-12-15 10:45:08,983 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-12-15 10:45:09,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:09,062 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-15 10:45:09,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:09,068 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-15 10:45:09,082 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 10:45:09,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2021-12-15 10:45:09,093 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 10:45:09,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2021-12-15 10:45:09,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:09,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-15 10:45:09,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:09,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-15 10:45:09,159 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 10:45:09,160 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 11 treesize of output 11 [2021-12-15 10:45:09,310 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 10:45:09,313 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 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-15 10:45:09,318 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 27 treesize of output 27 [2021-12-15 10:45:09,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:09,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-12-15 10:45:09,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:09,496 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:09,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-15 10:45:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:09,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:45:09,557 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_877 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (forall ((v_ArrVal_876 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_876) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0))) is different from false [2021-12-15 10:45:09,600 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_872 Int)) (or (not (= 0 (select |c_#valid| v_ArrVal_872))) (and (forall ((v_ArrVal_876 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_872)) v_ArrVal_872 v_ArrVal_876) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (forall ((v_ArrVal_877 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0)) v_ArrVal_872 v_ArrVal_877) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0))))) is different from false [2021-12-15 10:45:09,971 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:09,974 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:09,975 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 57 [2021-12-15 10:45:09,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:09,980 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:09,980 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 62 [2021-12-15 10:45:09,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:09,985 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:09,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 60 [2021-12-15 10:45:09,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:09,989 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:09,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 58 [2021-12-15 10:45:09,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 21 [2021-12-15 10:45:09,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 17 [2021-12-15 10:45:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-15 10:45:10,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351236679] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:45:10,014 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:45:10,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2021-12-15 10:45:10,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439258892] [2021-12-15 10:45:10,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:45:10,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 10:45:10,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:10,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 10:45:10,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2021-12-15 10:45:10,016 INFO L87 Difference]: Start difference. First operand 171 states and 207 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:10,064 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) .cse1) 0) (<= |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (forall ((v_ArrVal_872 Int)) (or (not (= 0 (select |c_#valid| v_ArrVal_872))) (and (forall ((v_ArrVal_876 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_872)) v_ArrVal_872 v_ArrVal_876) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (forall ((v_ArrVal_877 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0)) v_ArrVal_872 v_ArrVal_877) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0))))))) is different from false [2021-12-15 10:45:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:10,199 INFO L93 Difference]: Finished difference Result 305 states and 361 transitions. [2021-12-15 10:45:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 10:45:10,200 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-15 10:45:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:10,200 INFO L225 Difference]: With dead ends: 305 [2021-12-15 10:45:10,200 INFO L226 Difference]: Without dead ends: 213 [2021-12-15 10:45:10,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=212, Unknown=3, NotChecked=96, Total=380 [2021-12-15 10:45:10,201 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 92 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:10,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 558 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 289 Unchecked, 0.1s Time] [2021-12-15 10:45:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-15 10:45:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2021-12-15 10:45:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.2340425531914894) internal successors, (232), 192 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 232 transitions. [2021-12-15 10:45:10,207 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 232 transitions. Word has length 36 [2021-12-15 10:45:10,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:10,208 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 232 transitions. [2021-12-15 10:45:10,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 232 transitions. [2021-12-15 10:45:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 10:45:10,209 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:10,209 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:10,229 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-12-15 10:45:10,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:10,424 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:10,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:10,424 INFO L85 PathProgramCache]: Analyzing trace with hash -431498650, now seen corresponding path program 1 times [2021-12-15 10:45:10,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:10,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653640893] [2021-12-15 10:45:10,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:10,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:10,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:10,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653640893] [2021-12-15 10:45:10,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653640893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:10,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:10,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 10:45:10,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976626309] [2021-12-15 10:45:10,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:10,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 10:45:10,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:10,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 10:45:10,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:45:10,505 INFO L87 Difference]: Start difference. First operand 193 states and 232 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:10,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:10,577 INFO L93 Difference]: Finished difference Result 311 states and 376 transitions. [2021-12-15 10:45:10,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 10:45:10,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-15 10:45:10,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:10,579 INFO L225 Difference]: With dead ends: 311 [2021-12-15 10:45:10,579 INFO L226 Difference]: Without dead ends: 202 [2021-12-15 10:45:10,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-15 10:45:10,580 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 13 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:10,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 237 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:45:10,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-12-15 10:45:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2021-12-15 10:45:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 190 states have (on average 1.231578947368421) internal successors, (234), 194 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 234 transitions. [2021-12-15 10:45:10,592 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 234 transitions. Word has length 36 [2021-12-15 10:45:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:10,592 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 234 transitions. [2021-12-15 10:45:10,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 234 transitions. [2021-12-15 10:45:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 10:45:10,593 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:10,593 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:10,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-15 10:45:10,593 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:10,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:10,594 INFO L85 PathProgramCache]: Analyzing trace with hash 589569704, now seen corresponding path program 1 times [2021-12-15 10:45:10,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:10,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266255043] [2021-12-15 10:45:10,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:10,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:10,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:10,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266255043] [2021-12-15 10:45:10,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266255043] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:45:10,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154894121] [2021-12-15 10:45:10,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:10,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:10,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:10,784 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-12-15 10:45:10,784 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-12-15 10:45:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:10,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-15 10:45:10,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:45:10,916 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-12-15 10:45:10,939 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-12-15 10:45:10,942 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-12-15 10:45:11,083 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 10:45:11,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 10:45:11,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:11,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-15 10:45:11,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:11,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-15 10:45:11,109 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 16 treesize of output 18 [2021-12-15 10:45:11,112 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 23 [2021-12-15 10:45:11,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:11,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2021-12-15 10:45:11,224 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2021-12-15 10:45:11,257 INFO L354 Elim1Store]: treesize reduction 100, result has 30.6 percent of original size [2021-12-15 10:45:11,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 130 [2021-12-15 10:45:11,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:11,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:11,280 INFO L354 Elim1Store]: treesize reduction 44, result has 48.8 percent of original size [2021-12-15 10:45:11,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 109 [2021-12-15 10:45:11,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 59 treesize of output 51 [2021-12-15 10:45:11,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 59 treesize of output 51 [2021-12-15 10:45:11,304 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-15 10:45:11,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2021-12-15 10:45:11,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2021-12-15 10:45:11,461 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:11,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2021-12-15 10:45:11,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:11,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-12-15 10:45:11,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-12-15 10:45:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:11,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:45:11,920 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:11,921 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 99 [2021-12-15 10:45:11,928 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:11,928 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 102 [2021-12-15 10:45:13,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:13,721 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:13,722 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 123 [2021-12-15 10:45:13,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:13,736 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:13,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 120 [2021-12-15 10:45:13,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:13,742 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:13,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 320 treesize of output 304 [2021-12-15 10:45:13,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:13,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:13,749 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:13,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 214 [2021-12-15 10:45:13,759 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:13,759 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 220 treesize of output 224 [2021-12-15 10:45:13,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:13,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:13,769 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:13,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 344 treesize of output 328 [2021-12-15 10:45:13,779 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:13,780 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 337 treesize of output 293 [2021-12-15 10:45:13,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 153 treesize of output 149 [2021-12-15 10:45:13,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 149 treesize of output 137 [2021-12-15 10:45:13,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 137 treesize of output 125 [2021-12-15 10:45:13,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 125 treesize of output 121 [2021-12-15 10:45:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:14,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154894121] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:45:14,542 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:45:14,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2021-12-15 10:45:14,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519201523] [2021-12-15 10:45:14,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:45:14,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-15 10:45:14,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:14,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-15 10:45:14,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=233, Unknown=8, NotChecked=0, Total=306 [2021-12-15 10:45:14,544 INFO L87 Difference]: Start difference. First operand 195 states and 234 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:14,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:14,682 INFO L93 Difference]: Finished difference Result 298 states and 359 transitions. [2021-12-15 10:45:14,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 10:45:14,683 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-15 10:45:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:14,683 INFO L225 Difference]: With dead ends: 298 [2021-12-15 10:45:14,684 INFO L226 Difference]: Without dead ends: 206 [2021-12-15 10:45:14,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=290, Unknown=8, NotChecked=0, Total=380 [2021-12-15 10:45:14,684 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 54 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:14,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 496 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 139 Unchecked, 0.1s Time] [2021-12-15 10:45:14,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-15 10:45:14,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 197. [2021-12-15 10:45:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 192 states have (on average 1.2291666666666667) internal successors, (236), 196 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 236 transitions. [2021-12-15 10:45:14,690 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 236 transitions. Word has length 36 [2021-12-15 10:45:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:14,691 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 236 transitions. [2021-12-15 10:45:14,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 236 transitions. [2021-12-15 10:45:14,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 10:45:14,691 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:14,692 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] [2021-12-15 10:45:14,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 10:45:14,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:14,911 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-15 10:45:14,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:14,911 INFO L85 PathProgramCache]: Analyzing trace with hash -648373053, now seen corresponding path program 1 times [2021-12-15 10:45:14,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:14,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999730523] [2021-12-15 10:45:14,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:14,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 10:45:14,940 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 10:45:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 10:45:14,968 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 10:45:14,968 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-15 10:45:14,969 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2021-12-15 10:45:14,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2021-12-15 10:45:14,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2021-12-15 10:45:14,970 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2021-12-15 10:45:14,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2021-12-15 10:45:14,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2021-12-15 10:45:14,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2021-12-15 10:45:14,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2021-12-15 10:45:14,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2021-12-15 10:45:14,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2021-12-15 10:45:14,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2021-12-15 10:45:14,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2021-12-15 10:45:14,972 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2021-12-15 10:45:14,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-15 10:45:14,974 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:14,976 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 10:45:15,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:45:15 BoogieIcfgContainer [2021-12-15 10:45:15,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 10:45:15,017 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 10:45:15,017 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 10:45:15,017 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 10:45:15,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:45:03" (3/4) ... [2021-12-15 10:45:15,019 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-15 10:45:15,078 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 10:45:15,079 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 10:45:15,079 INFO L158 Benchmark]: Toolchain (without parser) took 11912.94ms. Allocated memory was 121.6MB in the beginning and 272.6MB in the end (delta: 151.0MB). Free memory was 86.1MB in the beginning and 242.5MB in the end (delta: -156.3MB). Peak memory consumption was 154.5MB. Max. memory is 16.1GB. [2021-12-15 10:45:15,079 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 38.6MB in the beginning and 38.5MB in the end (delta: 45.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 10:45:15,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.86ms. Allocated memory is still 121.6MB. Free memory was 85.9MB in the beginning and 84.7MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 10:45:15,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.69ms. Allocated memory is still 121.6MB. Free memory was 84.7MB in the beginning and 82.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 10:45:15,080 INFO L158 Benchmark]: Boogie Preprocessor took 46.78ms. Allocated memory is still 121.6MB. Free memory was 82.0MB in the beginning and 80.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 10:45:15,080 INFO L158 Benchmark]: RCFGBuilder took 347.99ms. Allocated memory is still 121.6MB. Free memory was 79.9MB in the beginning and 61.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-15 10:45:15,080 INFO L158 Benchmark]: TraceAbstraction took 11049.59ms. Allocated memory was 121.6MB in the beginning and 272.6MB in the end (delta: 151.0MB). Free memory was 61.0MB in the beginning and 87.4MB in the end (delta: -26.4MB). Peak memory consumption was 128.7MB. Max. memory is 16.1GB. [2021-12-15 10:45:15,080 INFO L158 Benchmark]: Witness Printer took 61.43ms. Allocated memory is still 272.6MB. Free memory was 87.4MB in the beginning and 242.5MB in the end (delta: -155.0MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2021-12-15 10:45:15,081 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.17ms. Allocated memory is still 79.7MB. Free memory was 38.6MB in the beginning and 38.5MB in the end (delta: 45.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.86ms. Allocated memory is still 121.6MB. Free memory was 85.9MB in the beginning and 84.7MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.69ms. Allocated memory is still 121.6MB. Free memory was 84.7MB in the beginning and 82.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.78ms. Allocated memory is still 121.6MB. Free memory was 82.0MB in the beginning and 80.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 347.99ms. Allocated memory is still 121.6MB. Free memory was 79.9MB in the beginning and 61.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11049.59ms. Allocated memory was 121.6MB in the beginning and 272.6MB in the end (delta: 151.0MB). Free memory was 61.0MB in the beginning and 87.4MB in the end (delta: -26.4MB). Peak memory consumption was 128.7MB. Max. memory is 16.1GB. * Witness Printer took 61.43ms. Allocated memory is still 272.6MB. Free memory was 87.4MB in the beginning and 242.5MB in the end (delta: -155.0MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 1036]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) VAL [list={-1:0}] [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) [L1004] EXPR list->inner [L1004] list->inner->next = ((void*)0) [L1004] EXPR list->inner [L1004] list->inner->inner = ((void*)0) [L1004] EXPR list->inner [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; [L1028] EXPR end->inner [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner [L1038] inner = inner->inner [L1039] COND TRUE len == 1 [L1040] EXPR inner->inner [L1040] inner = inner->inner [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={54:5}, len=1, list={-1:0}] [L1031] COND FALSE !(len == 0) [L1034] len = 2 VAL [end={-1:0}, inner={54:5}, len=2, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={54:5}, len=2, list={-1:0}] [L1036] EXPR inner->inner VAL [end={-1:0}, inner={54:5}, inner->inner={55:51}, len=2, list={-1:0}] [L1036] COND TRUE !(((void*)0) == inner->inner) [L1036] reach_error() VAL [end={-1:0}, inner={54:5}, len=2, list={-1:0}] - UnprovableResult [Line: 1004]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1572 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1572 mSDsluCounter, 4879 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 428 IncrementalHoareTripleChecker+Unchecked, 3278 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1522 IncrementalHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 1601 mSDtfsCounter, 1522 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 274 SyntacticMatches, 16 SemanticMatches, 111 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=21, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 659 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 661 NumberOfCodeBlocks, 661 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 729 ConstructedInterpolants, 62 QuantifiedInterpolants, 10449 SizeOfPredicates, 29 NumberOfNonLiveVariables, 778 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 14/33 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 proved your program to be incorrect! [2021-12-15 10:45:15,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE