./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -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 ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 15:02:30,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 15:02:30,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 15:02:30,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 15:02:30,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 15:02:30,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 15:02:30,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 15:02:30,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 15:02:30,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 15:02:30,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 15:02:30,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 15:02:30,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 15:02:30,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 15:02:30,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 15:02:30,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 15:02:30,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 15:02:30,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 15:02:30,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 15:02:30,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 15:02:30,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 15:02:30,450 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 15:02:30,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 15:02:30,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 15:02:30,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 15:02:30,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 15:02:30,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 15:02:30,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 15:02:30,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 15:02:30,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 15:02:30,458 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 15:02:30,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 15:02:30,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 15:02:30,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 15:02:30,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 15:02:30,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 15:02:30,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 15:02:30,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 15:02:30,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 15:02:30,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 15:02:30,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 15:02:30,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 15:02:30,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 15:02:30,466 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 15:02:30,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 15:02:30,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 15:02:30,485 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 15:02:30,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 15:02:30,486 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 15:02:30,486 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 15:02:30,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 15:02:30,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 15:02:30,487 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 15:02:30,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 15:02:30,487 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 15:02:30,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 15:02:30,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 15:02:30,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 15:02:30,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 15:02:30,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 15:02:30,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 15:02:30,489 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 15:02:30,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 15:02:30,489 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 15:02:30,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 15:02:30,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 15:02:30,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 15:02:30,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 15:02:30,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:02:30,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 15:02:30,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 15:02:30,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 15:02:30,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 15:02:30,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 15:02:30,491 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 15:02:30,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 15:02:30,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 15:02:30,492 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 -> ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c [2022-07-19 15:02:30,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 15:02:30,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 15:02:30,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 15:02:30,758 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 15:02:30,759 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 15:02:30,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-07-19 15:02:30,822 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b4a969d/4e55398a2c58420b93cfd90b10d4243f/FLAG5fde9e669 [2022-07-19 15:02:31,235 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 15:02:31,238 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-07-19 15:02:31,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b4a969d/4e55398a2c58420b93cfd90b10d4243f/FLAG5fde9e669 [2022-07-19 15:02:31,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b4a969d/4e55398a2c58420b93cfd90b10d4243f [2022-07-19 15:02:31,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 15:02:31,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 15:02:31,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 15:02:31,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 15:02:31,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 15:02:31,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:02:31" (1/1) ... [2022-07-19 15:02:31,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@480806e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:31, skipping insertion in model container [2022-07-19 15:02:31,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:02:31" (1/1) ... [2022-07-19 15:02:31,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 15:02:31,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 15:02:31,822 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-07-19 15:02:31,832 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-07-19 15:02:31,835 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-07-19 15:02:31,838 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-07-19 15:02:31,841 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-07-19 15:02:31,843 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-07-19 15:02:31,848 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-07-19 15:02:31,850 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-07-19 15:02:31,854 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-07-19 15:02:31,856 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-07-19 15:02:31,858 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-07-19 15:02:31,861 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-07-19 15:02:31,866 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-07-19 15:02:31,869 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-07-19 15:02:31,871 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-07-19 15:02:31,874 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-07-19 15:02:31,880 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-07-19 15:02:31,881 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-07-19 15:02:31,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:02:31,893 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 15:02:31,917 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-07-19 15:02:31,924 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-07-19 15:02:31,925 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-07-19 15:02:31,927 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-07-19 15:02:31,930 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-07-19 15:02:31,932 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-07-19 15:02:31,936 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-07-19 15:02:31,938 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-07-19 15:02:31,940 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-07-19 15:02:31,942 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-07-19 15:02:31,944 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-07-19 15:02:31,953 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-07-19 15:02:31,954 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-07-19 15:02:31,957 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-07-19 15:02:31,959 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-07-19 15:02:31,961 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-07-19 15:02:31,963 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-07-19 15:02:31,965 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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-07-19 15:02:31,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:02:31,981 INFO L208 MainTranslator]: Completed translation [2022-07-19 15:02:31,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:31 WrapperNode [2022-07-19 15:02:31,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 15:02:31,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 15:02:31,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 15:02:31,984 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 15:02:31,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:31" (1/1) ... [2022-07-19 15:02:32,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:31" (1/1) ... [2022-07-19 15:02:32,036 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 254 [2022-07-19 15:02:32,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 15:02:32,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 15:02:32,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 15:02:32,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 15:02:32,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:31" (1/1) ... [2022-07-19 15:02:32,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:31" (1/1) ... [2022-07-19 15:02:32,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:31" (1/1) ... [2022-07-19 15:02:32,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:31" (1/1) ... [2022-07-19 15:02:32,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:31" (1/1) ... [2022-07-19 15:02:32,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:31" (1/1) ... [2022-07-19 15:02:32,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:31" (1/1) ... [2022-07-19 15:02:32,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 15:02:32,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 15:02:32,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 15:02:32,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 15:02:32,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:31" (1/1) ... [2022-07-19 15:02:32,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:02:32,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:02:32,112 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) [2022-07-19 15:02:32,134 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 [2022-07-19 15:02:32,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 15:02:32,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 15:02:32,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 15:02:32,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 15:02:32,228 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 15:02:32,229 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 15:02:32,439 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 15:02:32,449 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 15:02:32,449 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 15:02:32,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:02:32 BoogieIcfgContainer [2022-07-19 15:02:32,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 15:02:32,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 15:02:32,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 15:02:32,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 15:02:32,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 03:02:31" (1/3) ... [2022-07-19 15:02:32,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db5be35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:02:32, skipping insertion in model container [2022-07-19 15:02:32,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:31" (2/3) ... [2022-07-19 15:02:32,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db5be35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:02:32, skipping insertion in model container [2022-07-19 15:02:32,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:02:32" (3/3) ... [2022-07-19 15:02:32,465 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2022-07-19 15:02:32,479 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 15:02:32,479 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-07-19 15:02:32,532 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 15:02:32,536 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a206a02, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4570cd62 [2022-07-19 15:02:32,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-07-19 15:02:32,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 15:02:32,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:32,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:32,557 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:32,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2022-07-19 15:02:32,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:32,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347810169] [2022-07-19 15:02:32,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:32,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:32,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:32,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347810169] [2022-07-19 15:02:32,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347810169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:32,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:32,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 15:02:32,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360156438] [2022-07-19 15:02:32,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:32,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 15:02:32,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:32,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 15:02:32,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 15:02:32,790 INFO L87 Difference]: Start difference. First operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 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 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) [2022-07-19 15:02:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:32,813 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2022-07-19 15:02:32,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 15:02:32,816 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 [2022-07-19 15:02:32,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:32,823 INFO L225 Difference]: With dead ends: 88 [2022-07-19 15:02:32,824 INFO L226 Difference]: Without dead ends: 76 [2022-07-19 15:02:32,826 INFO L412 NwaCegarLoop]: 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 [2022-07-19 15:02:32,830 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 75 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:32,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-19 15:02:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-07-19 15:02:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-07-19 15:02:32,870 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2022-07-19 15:02:32,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:32,870 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-07-19 15:02:32,871 INFO L496 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) [2022-07-19 15:02:32,871 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-07-19 15:02:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 15:02:32,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:32,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:32,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 15:02:32,872 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:32,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:32,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2022-07-19 15:02:32,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:32,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616634602] [2022-07-19 15:02:32,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:32,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:32,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:32,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616634602] [2022-07-19 15:02:32,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616634602] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:32,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:32,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 15:02:32,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082687263] [2022-07-19 15:02:32,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:32,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 15:02:32,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:32,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 15:02:32,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 15:02:32,970 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2022-07-19 15:02:33,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:33,058 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-07-19 15:02:33,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:02:33,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 [2022-07-19 15:02:33,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:33,060 INFO L225 Difference]: With dead ends: 76 [2022-07-19 15:02:33,060 INFO L226 Difference]: Without dead ends: 74 [2022-07-19 15:02:33,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 15:02:33,061 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 246 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:33,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 80 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-19 15:02:33,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-19 15:02:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:33,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-07-19 15:02:33,072 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2022-07-19 15:02:33,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:33,072 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-07-19 15:02:33,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2022-07-19 15:02:33,073 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-07-19 15:02:33,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 15:02:33,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:33,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:33,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 15:02:33,074 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:33,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:33,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2022-07-19 15:02:33,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:33,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63581999] [2022-07-19 15:02:33,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:33,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:33,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:33,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63581999] [2022-07-19 15:02:33,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63581999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:33,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:33,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 15:02:33,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177486352] [2022-07-19 15:02:33,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:33,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 15:02:33,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:33,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 15:02:33,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 15:02:33,148 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:33,231 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-07-19 15:02:33,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 15:02:33,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-07-19 15:02:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:33,232 INFO L225 Difference]: With dead ends: 97 [2022-07-19 15:02:33,232 INFO L226 Difference]: Without dead ends: 95 [2022-07-19 15:02:33,232 INFO L412 NwaCegarLoop]: 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 [2022-07-19 15:02:33,233 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 110 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:33,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 120 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:02:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-19 15:02:33,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2022-07-19 15:02:33,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-07-19 15:02:33,240 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2022-07-19 15:02:33,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:33,240 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-07-19 15:02:33,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-07-19 15:02:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 15:02:33,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:33,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:33,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 15:02:33,241 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:33,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:33,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2022-07-19 15:02:33,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:33,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340970085] [2022-07-19 15:02:33,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:33,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:33,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:33,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340970085] [2022-07-19 15:02:33,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340970085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:33,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:33,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:02:33,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856883391] [2022-07-19 15:02:33,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:33,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:02:33,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:33,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:02:33,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:33,377 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:33,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:33,445 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-07-19 15:02:33,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 15:02:33,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-07-19 15:02:33,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:33,446 INFO L225 Difference]: With dead ends: 72 [2022-07-19 15:02:33,447 INFO L226 Difference]: Without dead ends: 70 [2022-07-19 15:02:33,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:02:33,448 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 165 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:33,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 77 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-19 15:02:33,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-19 15:02:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 69 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) [2022-07-19 15:02:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-07-19 15:02:33,456 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2022-07-19 15:02:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:33,456 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-07-19 15:02:33,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:33,456 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-07-19 15:02:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 15:02:33,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:33,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:33,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 15:02:33,458 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:33,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:33,458 INFO L85 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2022-07-19 15:02:33,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:33,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197579900] [2022-07-19 15:02:33,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:33,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:33,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:33,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197579900] [2022-07-19 15:02:33,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197579900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:33,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:33,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:02:33,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206168957] [2022-07-19 15:02:33,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:33,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:02:33,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:33,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:02:33,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:33,541 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:33,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:33,690 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-07-19 15:02:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 15:02:33,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-07-19 15:02:33,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:33,695 INFO L225 Difference]: With dead ends: 137 [2022-07-19 15:02:33,695 INFO L226 Difference]: Without dead ends: 135 [2022-07-19 15:02:33,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 15:02:33,700 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 128 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:33,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 295 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:02:33,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-19 15:02:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2022-07-19 15:02:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-07-19 15:02:33,723 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2022-07-19 15:02:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:33,723 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-07-19 15:02:33,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-07-19 15:02:33,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 15:02:33,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:33,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:33,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 15:02:33,725 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:33,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:33,726 INFO L85 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2022-07-19 15:02:33,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:33,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324527172] [2022-07-19 15:02:33,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:33,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:33,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:33,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324527172] [2022-07-19 15:02:33,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324527172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:33,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:33,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:02:33,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765597992] [2022-07-19 15:02:33,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:33,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:02:33,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:33,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:02:33,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:33,828 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:33,932 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-07-19 15:02:33,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 15:02:33,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-07-19 15:02:33,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:33,934 INFO L225 Difference]: With dead ends: 104 [2022-07-19 15:02:33,934 INFO L226 Difference]: Without dead ends: 102 [2022-07-19 15:02:33,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 15:02:33,935 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 117 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:33,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 171 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:02:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-19 15:02:33,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2022-07-19 15:02:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 74 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:33,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-07-19 15:02:33,942 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2022-07-19 15:02:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:33,943 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-07-19 15:02:33,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-07-19 15:02:33,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 15:02:33,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:33,944 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:02:33,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 15:02:33,944 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:33,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2022-07-19 15:02:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:33,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744747167] [2022-07-19 15:02:33,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:33,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:34,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:34,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744747167] [2022-07-19 15:02:34,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744747167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:34,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:34,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:02:34,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186185039] [2022-07-19 15:02:34,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:34,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:02:34,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:34,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:02:34,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:34,008 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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) [2022-07-19 15:02:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:34,090 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2022-07-19 15:02:34,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 15:02:34,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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 [2022-07-19 15:02:34,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:34,091 INFO L225 Difference]: With dead ends: 117 [2022-07-19 15:02:34,091 INFO L226 Difference]: Without dead ends: 115 [2022-07-19 15:02:34,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:02:34,093 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 148 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:34,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 154 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:34,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-19 15:02:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2022-07-19 15:02:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.3) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:34,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-07-19 15:02:34,115 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2022-07-19 15:02:34,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:34,116 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-07-19 15:02:34,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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) [2022-07-19 15:02:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-07-19 15:02:34,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 15:02:34,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:34,117 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:02:34,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 15:02:34,117 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:34,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:34,118 INFO L85 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2022-07-19 15:02:34,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:34,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464791171] [2022-07-19 15:02:34,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:34,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:34,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464791171] [2022-07-19 15:02:34,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464791171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:34,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:34,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:02:34,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654929446] [2022-07-19 15:02:34,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:34,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:02:34,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:34,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:02:34,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:34,163 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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) [2022-07-19 15:02:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:34,216 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-07-19 15:02:34,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 15:02:34,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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 [2022-07-19 15:02:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:34,217 INFO L225 Difference]: With dead ends: 73 [2022-07-19 15:02:34,217 INFO L226 Difference]: Without dead ends: 71 [2022-07-19 15:02:34,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:02:34,218 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 132 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:34,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 94 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-19 15:02:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-19 15:02:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 70 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-07-19 15:02:34,223 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2022-07-19 15:02:34,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:34,224 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-07-19 15:02:34,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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) [2022-07-19 15:02:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-07-19 15:02:34,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 15:02:34,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:34,225 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:02:34,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 15:02:34,225 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:34,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2022-07-19 15:02:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:34,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871837501] [2022-07-19 15:02:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:34,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:34,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871837501] [2022-07-19 15:02:34,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871837501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:34,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:34,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 15:02:34,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909086613] [2022-07-19 15:02:34,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:34,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 15:02:34,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:34,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 15:02:34,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 15:02:34,261 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:34,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:34,291 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-07-19 15:02:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 15:02:34,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-07-19 15:02:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:34,292 INFO L225 Difference]: With dead ends: 111 [2022-07-19 15:02:34,292 INFO L226 Difference]: Without dead ends: 71 [2022-07-19 15:02:34,293 INFO L412 NwaCegarLoop]: 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 [2022-07-19 15:02:34,294 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:34,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:34,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-19 15:02:34,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-19 15:02:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 70 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) [2022-07-19 15:02:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-07-19 15:02:34,306 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2022-07-19 15:02:34,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:34,306 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-07-19 15:02:34,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:34,306 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-07-19 15:02:34,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 15:02:34,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:34,311 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:34,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 15:02:34,312 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:34,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:34,313 INFO L85 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2022-07-19 15:02:34,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:34,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15481729] [2022-07-19 15:02:34,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:34,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 15:02:34,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:34,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15481729] [2022-07-19 15:02:34,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15481729] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:02:34,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891317848] [2022-07-19 15:02:34,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:34,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:02:34,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:02:34,379 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) [2022-07-19 15:02:34,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 15:02:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:34,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 15:02:34,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:02:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 15:02:34,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:02:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 15:02:34,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891317848] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:02:34,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 15:02:34,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-07-19 15:02:34,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625505102] [2022-07-19 15:02:34,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 15:02:34,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 15:02:34,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:34,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 15:02:34,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 15:02:34,576 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:34,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:34,664 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-07-19 15:02:34,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:02:34,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 [2022-07-19 15:02:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:34,670 INFO L225 Difference]: With dead ends: 111 [2022-07-19 15:02:34,670 INFO L226 Difference]: Without dead ends: 109 [2022-07-19 15:02:34,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-19 15:02:34,671 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 89 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:34,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 179 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:02:34,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-19 15:02:34,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2022-07-19 15:02:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-07-19 15:02:34,679 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2022-07-19 15:02:34,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:34,681 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-07-19 15:02:34,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:34,681 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-07-19 15:02:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 15:02:34,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:34,682 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:02:34,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 15:02:34,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 15:02:34,895 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:34,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:34,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2022-07-19 15:02:34,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:34,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215550247] [2022-07-19 15:02:34,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:34,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:34,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:34,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215550247] [2022-07-19 15:02:34,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215550247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:34,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:34,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:02:34,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075368151] [2022-07-19 15:02:34,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:34,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:02:34,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:34,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:02:34,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:34,939 INFO L87 Difference]: Start difference. First operand 68 states and 71 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) [2022-07-19 15:02:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:34,988 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-07-19 15:02:34,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:02:34,988 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 [2022-07-19 15:02:34,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:34,989 INFO L225 Difference]: With dead ends: 69 [2022-07-19 15:02:34,989 INFO L226 Difference]: Without dead ends: 67 [2022-07-19 15:02:34,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:02:34,990 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 116 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:34,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 72 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-19 15:02:34,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-07-19 15:02:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-07-19 15:02:34,994 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2022-07-19 15:02:34,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:34,995 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-07-19 15:02:34,995 INFO L496 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) [2022-07-19 15:02:34,995 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-07-19 15:02:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 15:02:34,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:34,995 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:02:34,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 15:02:34,996 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:34,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:34,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2022-07-19 15:02:34,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:34,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321236661] [2022-07-19 15:02:34,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:34,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 15:02:35,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:35,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321236661] [2022-07-19 15:02:35,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321236661] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:02:35,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838714381] [2022-07-19 15:02:35,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:35,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:02:35,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:02:35,040 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) [2022-07-19 15:02:35,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 15:02:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:35,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 15:02:35,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:02:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 15:02:35,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:02:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 15:02:35,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838714381] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:02:35,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 15:02:35,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-07-19 15:02:35,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126170929] [2022-07-19 15:02:35,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 15:02:35,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 15:02:35,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:35,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 15:02:35,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 15:02:35,178 INFO L87 Difference]: Start difference. First operand 66 states and 69 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) [2022-07-19 15:02:35,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:35,222 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-07-19 15:02:35,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:02:35,222 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 27 [2022-07-19 15:02:35,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:35,224 INFO L225 Difference]: With dead ends: 67 [2022-07-19 15:02:35,224 INFO L226 Difference]: Without dead ends: 65 [2022-07-19 15:02:35,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-19 15:02:35,225 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 152 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:35,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 67 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:35,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-19 15:02:35,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2022-07-19 15:02:35,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-07-19 15:02:35,229 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2022-07-19 15:02:35,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:35,229 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-07-19 15:02:35,229 INFO L496 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) [2022-07-19 15:02:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-07-19 15:02:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 15:02:35,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:35,231 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:02:35,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 15:02:35,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-19 15:02:35,452 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:35,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:35,452 INFO L85 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2022-07-19 15:02:35,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:35,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152380131] [2022-07-19 15:02:35,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:35,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:35,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:35,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152380131] [2022-07-19 15:02:35,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152380131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:35,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:35,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:02:35,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750751221] [2022-07-19 15:02:35,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:35,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:02:35,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:35,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:02:35,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:35,496 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) [2022-07-19 15:02:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:35,532 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-07-19 15:02:35,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 15:02:35,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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 [2022-07-19 15:02:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:35,533 INFO L225 Difference]: With dead ends: 60 [2022-07-19 15:02:35,533 INFO L226 Difference]: Without dead ends: 58 [2022-07-19 15:02:35,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:02:35,535 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 108 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:35,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 68 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:35,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-19 15:02:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-07-19 15:02:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-07-19 15:02:35,539 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2022-07-19 15:02:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:35,540 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-07-19 15:02:35,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) [2022-07-19 15:02:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-07-19 15:02:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 15:02:35,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:35,541 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:02:35,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 15:02:35,542 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:35,542 INFO L85 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2022-07-19 15:02:35,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:35,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537354960] [2022-07-19 15:02:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:35,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:35,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:35,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:35,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537354960] [2022-07-19 15:02:35,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537354960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:35,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:35,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:02:35,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667398118] [2022-07-19 15:02:35,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:35,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:02:35,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:35,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:02:35,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:35,598 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:35,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:35,640 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-07-19 15:02:35,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:02:35,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-07-19 15:02:35,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:35,641 INFO L225 Difference]: With dead ends: 59 [2022-07-19 15:02:35,641 INFO L226 Difference]: Without dead ends: 57 [2022-07-19 15:02:35,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:02:35,642 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 64 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:35,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 73 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-19 15:02:35,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-07-19 15:02:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.183673469387755) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:35,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-07-19 15:02:35,645 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2022-07-19 15:02:35,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:35,645 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-07-19 15:02:35,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:35,646 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-07-19 15:02:35,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 15:02:35,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:35,647 INFO L195 NwaCegarLoop]: 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] [2022-07-19 15:02:35,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 15:02:35,647 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:35,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:35,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2022-07-19 15:02:35,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:35,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54149987] [2022-07-19 15:02:35,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:35,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:35,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:35,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54149987] [2022-07-19 15:02:35,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54149987] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:35,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:35,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 15:02:35,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419382017] [2022-07-19 15:02:35,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:35,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 15:02:35,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:35,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 15:02:35,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 15:02:35,713 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:35,769 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-07-19 15:02:35,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:02:35,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-07-19 15:02:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:35,770 INFO L225 Difference]: With dead ends: 67 [2022-07-19 15:02:35,770 INFO L226 Difference]: Without dead ends: 65 [2022-07-19 15:02:35,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-19 15:02:35,772 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 125 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:35,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 76 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-19 15:02:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2022-07-19 15:02:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-07-19 15:02:35,779 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2022-07-19 15:02:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:35,780 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-07-19 15:02:35,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-07-19 15:02:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 15:02:35,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:35,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:35,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 15:02:35,781 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:35,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:35,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2022-07-19 15:02:35,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:35,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16197549] [2022-07-19 15:02:35,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:35,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:35,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:35,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16197549] [2022-07-19 15:02:35,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16197549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:35,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:35,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:02:35,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609056982] [2022-07-19 15:02:35,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:35,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:02:35,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:35,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:02:35,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:35,833 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:35,904 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-07-19 15:02:35,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 15:02:35,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-07-19 15:02:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:35,905 INFO L225 Difference]: With dead ends: 87 [2022-07-19 15:02:35,906 INFO L226 Difference]: Without dead ends: 85 [2022-07-19 15:02:35,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:02:35,907 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 93 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:35,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 117 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-19 15:02:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2022-07-19 15:02:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 56 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-07-19 15:02:35,912 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2022-07-19 15:02:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:35,913 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-07-19 15:02:35,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-07-19 15:02:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 15:02:35,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:35,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:35,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 15:02:35,916 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:35,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:35,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2022-07-19 15:02:35,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:35,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546969884] [2022-07-19 15:02:35,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:35,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:35,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:35,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546969884] [2022-07-19 15:02:35,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546969884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:35,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:35,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:02:35,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917876126] [2022-07-19 15:02:35,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:35,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:02:35,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:35,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:02:35,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:35,960 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:36,011 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-07-19 15:02:36,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 15:02:36,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-07-19 15:02:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:36,012 INFO L225 Difference]: With dead ends: 57 [2022-07-19 15:02:36,012 INFO L226 Difference]: Without dead ends: 55 [2022-07-19 15:02:36,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:02:36,013 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 58 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:36,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 109 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:36,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-19 15:02:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-07-19 15:02:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-07-19 15:02:36,017 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2022-07-19 15:02:36,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:36,017 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-07-19 15:02:36,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-07-19 15:02:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 15:02:36,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:36,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:36,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 15:02:36,018 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:36,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2022-07-19 15:02:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:36,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573676733] [2022-07-19 15:02:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:36,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:36,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:36,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573676733] [2022-07-19 15:02:36,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573676733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:36,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:36,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 15:02:36,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308965060] [2022-07-19 15:02:36,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:36,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 15:02:36,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:36,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 15:02:36,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 15:02:36,052 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:36,071 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-07-19 15:02:36,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 15:02:36,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-07-19 15:02:36,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:36,072 INFO L225 Difference]: With dead ends: 66 [2022-07-19 15:02:36,072 INFO L226 Difference]: Without dead ends: 64 [2022-07-19 15:02:36,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:36,073 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 23 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:36,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 142 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:36,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-19 15:02:36,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2022-07-19 15:02:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-07-19 15:02:36,078 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2022-07-19 15:02:36,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:36,078 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-07-19 15:02:36,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-07-19 15:02:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 15:02:36,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:36,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:36,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 15:02:36,079 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:36,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:36,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2022-07-19 15:02:36,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:36,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617364449] [2022-07-19 15:02:36,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:36,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:36,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:36,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617364449] [2022-07-19 15:02:36,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617364449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:36,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:36,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:02:36,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236012115] [2022-07-19 15:02:36,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:36,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:02:36,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:36,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:02:36,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:36,129 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:36,149 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-07-19 15:02:36,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 15:02:36,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-07-19 15:02:36,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:36,150 INFO L225 Difference]: With dead ends: 62 [2022-07-19 15:02:36,150 INFO L226 Difference]: Without dead ends: 60 [2022-07-19 15:02:36,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 15:02:36,151 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:36,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 172 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-19 15:02:36,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2022-07-19 15:02:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 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) [2022-07-19 15:02:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-07-19 15:02:36,162 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2022-07-19 15:02:36,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:36,163 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-07-19 15:02:36,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,163 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-07-19 15:02:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 15:02:36,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:36,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:36,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 15:02:36,164 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:36,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:36,164 INFO L85 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2022-07-19 15:02:36,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:36,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243317293] [2022-07-19 15:02:36,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:36,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:36,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243317293] [2022-07-19 15:02:36,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243317293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:36,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:36,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:02:36,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916428644] [2022-07-19 15:02:36,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:36,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:02:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:36,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:02:36,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:36,222 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:36,319 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-07-19 15:02:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 15:02:36,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-19 15:02:36,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:36,320 INFO L225 Difference]: With dead ends: 84 [2022-07-19 15:02:36,320 INFO L226 Difference]: Without dead ends: 82 [2022-07-19 15:02:36,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:02:36,321 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 52 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:36,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 125 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:02:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-19 15:02:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2022-07-19 15:02:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-07-19 15:02:36,329 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2022-07-19 15:02:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:36,329 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-07-19 15:02:36,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-07-19 15:02:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 15:02:36,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:36,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:36,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 15:02:36,331 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:36,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2022-07-19 15:02:36,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:36,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548973416] [2022-07-19 15:02:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:36,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:36,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:36,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548973416] [2022-07-19 15:02:36,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548973416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:36,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:36,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:02:36,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115322989] [2022-07-19 15:02:36,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:36,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:02:36,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:36,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:02:36,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:36,398 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:36,461 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-07-19 15:02:36,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 15:02:36,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-07-19 15:02:36,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:36,462 INFO L225 Difference]: With dead ends: 69 [2022-07-19 15:02:36,462 INFO L226 Difference]: Without dead ends: 67 [2022-07-19 15:02:36,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:02:36,464 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 35 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:36,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 119 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:36,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-19 15:02:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2022-07-19 15:02:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-07-19 15:02:36,468 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2022-07-19 15:02:36,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:36,468 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-07-19 15:02:36,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,469 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-07-19 15:02:36,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 15:02:36,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:36,469 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:36,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 15:02:36,471 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:36,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:36,471 INFO L85 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2022-07-19 15:02:36,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:36,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186523555] [2022-07-19 15:02:36,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:36,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:36,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:36,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186523555] [2022-07-19 15:02:36,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186523555] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:02:36,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589425285] [2022-07-19 15:02:36,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:36,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:02:36,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:02:36,535 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) [2022-07-19 15:02:36,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 15:02:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:36,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 15:02:36,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:02:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:36,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:02:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:36,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589425285] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:02:36,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 15:02:36,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-07-19 15:02:36,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378062074] [2022-07-19 15:02:36,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 15:02:36,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 15:02:36,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:36,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 15:02:36,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 15:02:36,713 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:36,761 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-07-19 15:02:36,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:02:36,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-19 15:02:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:36,762 INFO L225 Difference]: With dead ends: 54 [2022-07-19 15:02:36,762 INFO L226 Difference]: Without dead ends: 52 [2022-07-19 15:02:36,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-19 15:02:36,764 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 55 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:36,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 54 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:36,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-19 15:02:36,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-19 15:02:36,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-07-19 15:02:36,769 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2022-07-19 15:02:36,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:36,769 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-07-19 15:02:36,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:36,769 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-07-19 15:02:36,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 15:02:36,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:36,770 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:36,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 15:02:36,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:02:36,979 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-07-19 15:02:36,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:36,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2022-07-19 15:02:36,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:36,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760376790] [2022-07-19 15:02:36,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:36,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 15:02:37,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:37,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760376790] [2022-07-19 15:02:37,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760376790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:37,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:37,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:02:37,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645643220] [2022-07-19 15:02:37,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:37,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:02:37,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:37,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:02:37,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:37,024 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:37,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:37,102 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-07-19 15:02:37,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 15:02:37,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2022-07-19 15:02:37,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:37,103 INFO L225 Difference]: With dead ends: 71 [2022-07-19 15:02:37,103 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 15:02:37,104 INFO L412 NwaCegarLoop]: 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 [2022-07-19 15:02:37,105 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:37,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 86 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:37,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 15:02:37,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 15:02:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 15:02:37,106 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-07-19 15:02:37,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:37,106 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 15:02:37,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 15:02:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 15:02:37,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 15:02:37,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-07-19 15:02:37,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-07-19 15:02:37,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-07-19 15:02:37,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-07-19 15:02:37,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-07-19 15:02:37,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-07-19 15:02:37,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-07-19 15:02:37,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-07-19 15:02:37,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-07-19 15:02:37,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-07-19 15:02:37,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-07-19 15:02:37,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-07-19 15:02:37,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-07-19 15:02:37,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-07-19 15:02:37,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-07-19 15:02:37,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-07-19 15:02:37,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-07-19 15:02:37,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-07-19 15:02:37,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 15:02:37,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 15:02:49,080 WARN L233 SmtUtils]: Spent 11.96s on a formula simplification. DAG size of input: 120 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 15:02:52,566 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2022-07-19 15:02:52,566 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-07-19 15:02:52,566 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 338) no Hoare annotation was computed. [2022-07-19 15:02:52,567 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2022-07-19 15:02:52,567 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 397) no Hoare annotation was computed. [2022-07-19 15:02:52,567 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 15:02:52,567 INFO L899 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2022-07-19 15:02:52,567 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 433) no Hoare annotation was computed. [2022-07-19 15:02:52,567 INFO L899 garLoopResultBuilder]: For program point L384(lines 384 393) no Hoare annotation was computed. [2022-07-19 15:02:52,567 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2022-07-19 15:02:52,568 INFO L895 garLoopResultBuilder]: At program point L401(lines 131 402) the Hoare annotation is: (and (not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1) (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse2 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse4 (not (<= |ULTIMATE.start_main_~main__scheme~0#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) .cse2 .cse3 .cse4)))) [2022-07-19 15:02:52,568 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 411) no Hoare annotation was computed. [2022-07-19 15:02:52,568 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 416) no Hoare annotation was computed. [2022-07-19 15:02:52,568 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-07-19 15:02:52,568 INFO L899 garLoopResultBuilder]: For program point L253(lines 253 329) no Hoare annotation was computed. [2022-07-19 15:02:52,568 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 355) no Hoare annotation was computed. [2022-07-19 15:02:52,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2022-07-19 15:02:52,569 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 322) no Hoare annotation was computed. [2022-07-19 15:02:52,569 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 353) no Hoare annotation was computed. [2022-07-19 15:02:52,569 INFO L899 garLoopResultBuilder]: For program point L386(line 386) no Hoare annotation was computed. [2022-07-19 15:02:52,569 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 360) no Hoare annotation was computed. [2022-07-19 15:02:52,569 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 438) no Hoare annotation was computed. [2022-07-19 15:02:52,569 INFO L899 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-07-19 15:02:52,570 INFO L899 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-07-19 15:02:52,570 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 403) no Hoare annotation was computed. [2022-07-19 15:02:52,570 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2022-07-19 15:02:52,570 INFO L899 garLoopResultBuilder]: For program point L272(line 272) no Hoare annotation was computed. [2022-07-19 15:02:52,570 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 435) no Hoare annotation was computed. [2022-07-19 15:02:52,570 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 15:02:52,570 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-07-19 15:02:52,571 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-07-19 15:02:52,571 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 395) no Hoare annotation was computed. [2022-07-19 15:02:52,571 INFO L899 garLoopResultBuilder]: For program point L306(lines 306 316) no Hoare annotation was computed. [2022-07-19 15:02:52,571 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 344) no Hoare annotation was computed. [2022-07-19 15:02:52,571 INFO L899 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-07-19 15:02:52,571 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 432) no Hoare annotation was computed. [2022-07-19 15:02:52,571 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2022-07-19 15:02:52,572 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 331) no Hoare annotation was computed. [2022-07-19 15:02:52,572 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 357) no Hoare annotation was computed. [2022-07-19 15:02:52,572 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2022-07-19 15:02:52,572 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2022-07-19 15:02:52,572 INFO L899 garLoopResultBuilder]: For program point L374(line 374) no Hoare annotation was computed. [2022-07-19 15:02:52,572 INFO L899 garLoopResultBuilder]: For program point L308(line 308) no Hoare annotation was computed. [2022-07-19 15:02:52,572 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 362) no Hoare annotation was computed. [2022-07-19 15:02:52,572 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-07-19 15:02:52,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-07-19 15:02:52,573 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 427) no Hoare annotation was computed. [2022-07-19 15:02:52,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 15:02:52,573 INFO L899 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2022-07-19 15:02:52,573 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-07-19 15:02:52,573 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 405) no Hoare annotation was computed. [2022-07-19 15:02:52,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2022-07-19 15:02:52,574 INFO L895 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (and (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse1 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse3 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse5 (not (<= |ULTIMATE.start_main_~main__scheme~0#1| 0)))) (or (and .cse0 .cse1 .cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 0)) .cse3 .cse4 (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1|) .cse5) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) .cse3 .cse4 .cse5)))) [2022-07-19 15:02:52,574 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 354) no Hoare annotation was computed. [2022-07-19 15:02:52,574 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 412) no Hoare annotation was computed. [2022-07-19 15:02:52,574 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 437) no Hoare annotation was computed. [2022-07-19 15:02:52,574 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2022-07-19 15:02:52,574 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-07-19 15:02:52,575 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2022-07-19 15:02:52,575 INFO L895 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 1) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1) (< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|) (let ((.cse0 (let ((.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse3 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse5 (< 0 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse6 (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1|)) (.cse7 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))) (.cse8 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0))) (.cse9 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse10 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse11 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))) (.cse12 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))) (.cse13 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0)) .cse12 .cse13) (and .cse1 .cse2 (<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))))) (or (and .cse0 (= |ULTIMATE.start_main_~main__c~0#1| 0)) (and (<= 1 |ULTIMATE.start_main_~main__c~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)) .cse0)))) [2022-07-19 15:02:52,575 INFO L899 garLoopResultBuilder]: For program point L294(lines 294 318) no Hoare annotation was computed. [2022-07-19 15:02:52,575 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 359) no Hoare annotation was computed. [2022-07-19 15:02:52,575 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 422) no Hoare annotation was computed. [2022-07-19 15:02:52,575 INFO L895 garLoopResultBuilder]: At program point L410(lines 104 411) the Hoare annotation is: (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0)) [2022-07-19 15:02:52,576 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 346) no Hoare annotation was computed. [2022-07-19 15:02:52,576 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-07-19 15:02:52,576 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 434) no Hoare annotation was computed. [2022-07-19 15:02:52,576 INFO L899 garLoopResultBuilder]: For program point L262(lines 262 328) no Hoare annotation was computed. [2022-07-19 15:02:52,576 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-07-19 15:02:52,576 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-07-19 15:02:52,576 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2022-07-19 15:02:52,576 INFO L899 garLoopResultBuilder]: For program point L296(line 296) no Hoare annotation was computed. [2022-07-19 15:02:52,577 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 417) no Hoare annotation was computed. [2022-07-19 15:02:52,577 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 15:02:52,577 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-07-19 15:02:52,577 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-07-19 15:02:52,577 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 414) no Hoare annotation was computed. [2022-07-19 15:02:52,577 INFO L895 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))) (.cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse4 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse5 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse6 (< 0 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1|)) (.cse8 (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)) (.cse11 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse12 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse13 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1)) (.cse14 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))) (.cse15 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))) (.cse16 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0))) (.cse1 (= |ULTIMATE.start_main_~main__c~0#1| 0))) (or (and (let ((.cse0 (let ((.cse9 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))) (.cse10 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0)))) (or (and .cse2 .cse3 (<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0)) .cse15 .cse16))))) (or (and .cse0 .cse1) (and (<= 1 |ULTIMATE.start_main_~main__c~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)) .cse0))) (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1|)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 1) .cse11 .cse12 .cse13 .cse14 (< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|) .cse15 .cse16 .cse1))) [2022-07-19 15:02:52,578 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2022-07-19 15:02:52,578 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 320) no Hoare annotation was computed. [2022-07-19 15:02:52,578 INFO L902 garLoopResultBuilder]: At program point L431(lines 13 439) the Hoare annotation is: true [2022-07-19 15:02:52,578 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 436) no Hoare annotation was computed. [2022-07-19 15:02:52,581 INFO L356 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, 1] [2022-07-19 15:02:52,582 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 15:02:52,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 03:02:52 BoogieIcfgContainer [2022-07-19 15:02:52,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 15:02:52,603 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 15:02:52,603 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 15:02:52,603 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 15:02:52,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:02:32" (3/4) ... [2022-07-19 15:02:52,606 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 15:02:52,616 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-19 15:02:52,616 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-19 15:02:52,617 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 15:02:52,617 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 15:02:52,662 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 15:02:52,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 15:02:52,662 INFO L158 Benchmark]: Toolchain (without parser) took 21019.23ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 68.4MB in the beginning and 151.5MB in the end (delta: -83.2MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. [2022-07-19 15:02:52,663 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 81.8MB. Free memory was 51.7MB in the beginning and 51.7MB in the end (delta: 23.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 15:02:52,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.76ms. Allocated memory is still 100.7MB. Free memory was 68.1MB in the beginning and 67.5MB in the end (delta: 573.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 15:02:52,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.34ms. Allocated memory is still 100.7MB. Free memory was 67.5MB in the beginning and 65.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 15:02:52,664 INFO L158 Benchmark]: Boogie Preprocessor took 39.53ms. Allocated memory is still 100.7MB. Free memory was 65.5MB in the beginning and 64.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 15:02:52,664 INFO L158 Benchmark]: RCFGBuilder took 373.27ms. Allocated memory is still 100.7MB. Free memory was 64.0MB in the beginning and 48.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 15:02:52,665 INFO L158 Benchmark]: TraceAbstraction took 20149.83ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 47.7MB in the beginning and 53.7MB in the end (delta: -6.0MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2022-07-19 15:02:52,667 INFO L158 Benchmark]: Witness Printer took 59.24ms. Allocated memory is still 176.2MB. Free memory was 53.7MB in the beginning and 151.5MB in the end (delta: -97.9MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2022-07-19 15:02:52,676 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.63ms. Allocated memory is still 81.8MB. Free memory was 51.7MB in the beginning and 51.7MB in the end (delta: 23.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.76ms. Allocated memory is still 100.7MB. Free memory was 68.1MB in the beginning and 67.5MB in the end (delta: 573.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.34ms. Allocated memory is still 100.7MB. Free memory was 67.5MB in the beginning and 65.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.53ms. Allocated memory is still 100.7MB. Free memory was 65.5MB in the beginning and 64.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 373.27ms. Allocated memory is still 100.7MB. Free memory was 64.0MB in the beginning and 48.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20149.83ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 47.7MB in the beginning and 53.7MB in the end (delta: -6.0MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. * Witness Printer took 59.24ms. Allocated memory is still 176.2MB. Free memory was 53.7MB in the beginning and 151.5MB in the end (delta: -97.9MB). Peak memory consumption was 4.9MB. 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 - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 20.1s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2162 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2162 mSDsluCounter, 2684 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1437 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1152 IncrementalHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 1247 mSDtfsCounter, 1152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 213 SyntacticMatches, 18 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 300 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 679 HoareAnnotationTreeSize, 6 FomulaSimplifications, 68221 FormulaSimplificationTreeSizeReduction, 14.7s HoareSimplificationTime, 6 FomulaSimplificationsInter, 312870 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 1807 SizeOfPredicates, 12 NumberOfNonLiveVariables, 362 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 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 - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0) || ((1 <= main__c && !(__VERIFIER_assert__cond == 0)) && ((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))))) && 1 <= __VERIFIER_assert__cond) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && ((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0) || ((1 <= main__c && !(__VERIFIER_assert__cond == 0)) && ((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))))) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: main__cp < main__urilen && ((((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && !(main__scheme <= 0)) || ((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(main__scheme <= 0))) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (!(main__urilen <= main__cp) && __VERIFIER_assert__cond == 1) && ((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(main__scheme <= 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(main__scheme <= 0))) RESULT: Ultimate proved your program to be correct! [2022-07-19 15:02:52,722 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 Result: TRUE