./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 13:55:51,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 13:55:51,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 13:55:51,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 13:55:51,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 13:55:51,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 13:55:51,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 13:55:51,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 13:55:51,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 13:55:51,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 13:55:51,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 13:55:51,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 13:55:51,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 13:55:51,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 13:55:51,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 13:55:51,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 13:55:51,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 13:55:51,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 13:55:51,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 13:55:51,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 13:55:51,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 13:55:51,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 13:55:51,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 13:55:51,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 13:55:51,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 13:55:51,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 13:55:51,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 13:55:51,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 13:55:51,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 13:55:51,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 13:55:51,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 13:55:51,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 13:55:51,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 13:55:51,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 13:55:51,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 13:55:51,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 13:55:51,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 13:55:51,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 13:55:51,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 13:55:51,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 13:55:51,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 13:55:51,577 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-15 13:55:51,601 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 13:55:51,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 13:55:51,602 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 13:55:51,602 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 13:55:51,603 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 13:55:51,603 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 13:55:51,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 13:55:51,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 13:55:51,604 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 13:55:51,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 13:55:51,604 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 13:55:51,605 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 13:55:51,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 13:55:51,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 13:55:51,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 13:55:51,605 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 13:55:51,605 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 13:55:51,606 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 13:55:51,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 13:55:51,606 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 13:55:51,606 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 13:55:51,606 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 13:55:51,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 13:55:51,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 13:55:51,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 13:55:51,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 13:55:51,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 13:55:51,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 13:55:51,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 13:55:51,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 13:55:51,608 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 13:55:51,608 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 [2021-12-15 13:55:51,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 13:55:51,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 13:55:51,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 13:55:51,810 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 13:55:51,816 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 13:55:51,818 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2021-12-15 13:55:51,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c37028b1/291fdf5562d847dba83d395ce16bb63a/FLAG5a57bdc6a [2021-12-15 13:55:52,282 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 13:55:52,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2021-12-15 13:55:52,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c37028b1/291fdf5562d847dba83d395ce16bb63a/FLAG5a57bdc6a [2021-12-15 13:55:52,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c37028b1/291fdf5562d847dba83d395ce16bb63a [2021-12-15 13:55:52,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 13:55:52,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 13:55:52,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 13:55:52,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 13:55:52,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 13:55:52,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:55:52" (1/1) ... [2021-12-15 13:55:52,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75aa4f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:52, skipping insertion in model container [2021-12-15 13:55:52,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:55:52" (1/1) ... [2021-12-15 13:55:52,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 13:55:52,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 13:55:52,535 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 13:55:52,540 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 13:55:52,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 13:55:52,604 INFO L208 MainTranslator]: Completed translation [2021-12-15 13:55:52,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:52 WrapperNode [2021-12-15 13:55:52,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 13:55:52,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 13:55:52,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 13:55:52,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 13:55:52,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:52" (1/1) ... [2021-12-15 13:55:52,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:52" (1/1) ... [2021-12-15 13:55:52,649 INFO L137 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2021-12-15 13:55:52,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 13:55:52,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 13:55:52,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 13:55:52,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 13:55:52,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:52" (1/1) ... [2021-12-15 13:55:52,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:52" (1/1) ... [2021-12-15 13:55:52,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:52" (1/1) ... [2021-12-15 13:55:52,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:52" (1/1) ... [2021-12-15 13:55:52,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:52" (1/1) ... [2021-12-15 13:55:52,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:52" (1/1) ... [2021-12-15 13:55:52,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:52" (1/1) ... [2021-12-15 13:55:52,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 13:55:52,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 13:55:52,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 13:55:52,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 13:55:52,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:52" (1/1) ... [2021-12-15 13:55:52,691 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 13:55:52,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:55:52,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 13:55:52,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 13:55:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 13:55:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 13:55:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 13:55:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 13:55:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 13:55:52,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 13:55:52,826 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 13:55:52,827 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 13:55:52,933 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 13:55:52,937 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 13:55:52,937 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-15 13:55:52,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:55:52 BoogieIcfgContainer [2021-12-15 13:55:52,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 13:55:52,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 13:55:52,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 13:55:52,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 13:55:52,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 01:55:52" (1/3) ... [2021-12-15 13:55:52,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0f43c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 01:55:52, skipping insertion in model container [2021-12-15 13:55:52,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:55:52" (2/3) ... [2021-12-15 13:55:52,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0f43c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 01:55:52, skipping insertion in model container [2021-12-15 13:55:52,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:55:52" (3/3) ... [2021-12-15 13:55:52,944 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca-2.i [2021-12-15 13:55:52,947 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 13:55:52,947 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-12-15 13:55:52,975 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 13:55:52,987 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 13:55:52,998 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-12-15 13:55:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:55:53,021 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:53,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:53,022 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2021-12-15 13:55:53,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:53,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695659489] [2021-12-15 13:55:53,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:53,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:53,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:53,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695659489] [2021-12-15 13:55:53,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695659489] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:53,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:53,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 13:55:53,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041232397] [2021-12-15 13:55:53,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:53,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 13:55:53,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:53,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 13:55:53,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:55:53,195 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:53,235 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2021-12-15 13:55:53,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 13:55:53,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-12-15 13:55:53,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:53,242 INFO L225 Difference]: With dead ends: 33 [2021-12-15 13:55:53,243 INFO L226 Difference]: Without dead ends: 31 [2021-12-15 13:55:53,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:55:53,251 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:53,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-15 13:55:53,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-15 13:55:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2021-12-15 13:55:53,277 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 7 [2021-12-15 13:55:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:53,277 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2021-12-15 13:55:53,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:53,279 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2021-12-15 13:55:53,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:55:53,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:53,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:53,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 13:55:53,282 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:53,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:53,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2021-12-15 13:55:53,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:53,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597293314] [2021-12-15 13:55:53,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:53,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:53,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:53,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597293314] [2021-12-15 13:55:53,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597293314] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:53,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:53,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 13:55:53,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720163889] [2021-12-15 13:55:53,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:53,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:55:53,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:53,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:55:53,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:55:53,393 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:53,425 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2021-12-15 13:55:53,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:55:53,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-12-15 13:55:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:53,426 INFO L225 Difference]: With dead ends: 30 [2021-12-15 13:55:53,426 INFO L226 Difference]: Without dead ends: 30 [2021-12-15 13:55:53,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:55:53,427 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 57 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:53,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 25 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:53,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-15 13:55:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-15 13:55:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 29 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) [2021-12-15 13:55:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-12-15 13:55:53,433 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2021-12-15 13:55:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:53,434 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-15 13:55:53,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-12-15 13:55:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:55:53,452 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:53,456 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:53,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 13:55:53,457 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:53,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:53,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2021-12-15 13:55:53,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:53,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654892739] [2021-12-15 13:55:53,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:53,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:53,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:53,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654892739] [2021-12-15 13:55:53,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654892739] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:53,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:53,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:55:53,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233689767] [2021-12-15 13:55:53,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:53,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:55:53,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:53,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:55:53,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:55:53,513 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:53,543 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2021-12-15 13:55:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:55:53,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-12-15 13:55:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:53,544 INFO L225 Difference]: With dead ends: 53 [2021-12-15 13:55:53,544 INFO L226 Difference]: Without dead ends: 53 [2021-12-15 13:55:53,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:55:53,545 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 48 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:53,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 62 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-15 13:55:53,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2021-12-15 13:55:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.56) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2021-12-15 13:55:53,549 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2021-12-15 13:55:53,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:53,549 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2021-12-15 13:55:53,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2021-12-15 13:55:53,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 13:55:53,550 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:53,550 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:53,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 13:55:53,550 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:53,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:53,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2021-12-15 13:55:53,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:53,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564273441] [2021-12-15 13:55:53,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:53,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:53,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:53,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564273441] [2021-12-15 13:55:53,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564273441] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:53,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:53,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 13:55:53,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550941563] [2021-12-15 13:55:53,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:53,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:55:53,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:53,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:55:53,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:55:53,625 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:53,680 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2021-12-15 13:55:53,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:55:53,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-12-15 13:55:53,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:53,681 INFO L225 Difference]: With dead ends: 57 [2021-12-15 13:55:53,682 INFO L226 Difference]: Without dead ends: 57 [2021-12-15 13:55:53,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:55:53,684 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 81 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:53,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 43 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-15 13:55:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2021-12-15 13:55:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2021-12-15 13:55:53,692 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 7 [2021-12-15 13:55:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:53,693 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2021-12-15 13:55:53,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2021-12-15 13:55:53,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 13:55:53,694 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:53,694 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:53,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 13:55:53,694 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:53,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:53,695 INFO L85 PathProgramCache]: Analyzing trace with hash 629680341, now seen corresponding path program 1 times [2021-12-15 13:55:53,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:53,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854650711] [2021-12-15 13:55:53,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:53,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:53,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:53,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854650711] [2021-12-15 13:55:53,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854650711] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:53,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:53,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 13:55:53,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479132679] [2021-12-15 13:55:53,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:53,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 13:55:53,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:53,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 13:55:53,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-15 13:55:53,808 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:53,882 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2021-12-15 13:55:53,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 13:55:53,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 13:55:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:53,885 INFO L225 Difference]: With dead ends: 46 [2021-12-15 13:55:53,885 INFO L226 Difference]: Without dead ends: 46 [2021-12-15 13:55:53,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-15 13:55:53,891 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 126 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:53,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 66 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:53,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-15 13:55:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2021-12-15 13:55:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2021-12-15 13:55:53,901 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 10 [2021-12-15 13:55:53,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:53,901 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2021-12-15 13:55:53,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:53,901 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2021-12-15 13:55:53,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 13:55:53,902 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:53,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:53,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 13:55:53,904 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:53,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:53,906 INFO L85 PathProgramCache]: Analyzing trace with hash 629680340, now seen corresponding path program 1 times [2021-12-15 13:55:53,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:53,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504494978] [2021-12-15 13:55:53,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:53,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:53,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:53,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504494978] [2021-12-15 13:55:53,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504494978] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:53,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:53,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:55:53,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424069410] [2021-12-15 13:55:53,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:53,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 13:55:53,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:53,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 13:55:53,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:55:53,963 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:54,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:54,005 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2021-12-15 13:55:54,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 13:55:54,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 13:55:54,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:54,007 INFO L225 Difference]: With dead ends: 36 [2021-12-15 13:55:54,008 INFO L226 Difference]: Without dead ends: 36 [2021-12-15 13:55:54,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 13:55:54,009 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:54,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 49 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-15 13:55:54,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-12-15 13:55:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 35 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) [2021-12-15 13:55:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2021-12-15 13:55:54,016 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 10 [2021-12-15 13:55:54,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:54,017 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2021-12-15 13:55:54,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2021-12-15 13:55:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 13:55:54,017 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:54,017 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:54,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 13:55:54,018 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:54,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:54,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1954745921, now seen corresponding path program 1 times [2021-12-15 13:55:54,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:54,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362814629] [2021-12-15 13:55:54,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:54,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:54,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:54,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362814629] [2021-12-15 13:55:54,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362814629] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:54,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:54,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 13:55:54,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555232645] [2021-12-15 13:55:54,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:54,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 13:55:54,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:54,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 13:55:54,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-15 13:55:54,096 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:54,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:54,126 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-12-15 13:55:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 13:55:54,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-15 13:55:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:54,127 INFO L225 Difference]: With dead ends: 35 [2021-12-15 13:55:54,127 INFO L226 Difference]: Without dead ends: 35 [2021-12-15 13:55:54,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-15 13:55:54,128 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:54,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-15 13:55:54,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-12-15 13:55:54,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2021-12-15 13:55:54,130 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2021-12-15 13:55:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:54,131 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2021-12-15 13:55:54,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2021-12-15 13:55:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 13:55:54,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:54,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:54,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 13:55:54,132 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:54,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:54,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1954745920, now seen corresponding path program 1 times [2021-12-15 13:55:54,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:54,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336142904] [2021-12-15 13:55:54,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:54,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:54,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:54,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336142904] [2021-12-15 13:55:54,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336142904] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:54,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:54,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 13:55:54,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40518028] [2021-12-15 13:55:54,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:54,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 13:55:54,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:54,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 13:55:54,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-15 13:55:54,190 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:54,232 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2021-12-15 13:55:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 13:55:54,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-15 13:55:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:54,233 INFO L225 Difference]: With dead ends: 41 [2021-12-15 13:55:54,233 INFO L226 Difference]: Without dead ends: 41 [2021-12-15 13:55:54,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-15 13:55:54,234 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:54,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-15 13:55:54,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2021-12-15 13:55:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 35 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) [2021-12-15 13:55:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2021-12-15 13:55:54,236 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 11 [2021-12-15 13:55:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:54,237 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2021-12-15 13:55:54,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2021-12-15 13:55:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 13:55:54,237 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:54,238 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:54,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 13:55:54,238 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:54,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:54,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2021-12-15 13:55:54,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:54,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116848920] [2021-12-15 13:55:54,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:54,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:54,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:54,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116848920] [2021-12-15 13:55:54,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116848920] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:55:54,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329544336] [2021-12-15 13:55:54,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:54,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:55:54,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:55:54,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:55:54,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 13:55:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:54,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 13:55:54,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:55:54,421 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:55:54,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 13:55:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:54,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:55:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:54,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329544336] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:55:54,611 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:55:54,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-12-15 13:55:54,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931692863] [2021-12-15 13:55:54,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:55:54,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 13:55:54,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:54,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 13:55:54,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-15 13:55:54,612 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:54,709 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2021-12-15 13:55:54,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 13:55:54,709 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 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 11 [2021-12-15 13:55:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:54,710 INFO L225 Difference]: With dead ends: 80 [2021-12-15 13:55:54,710 INFO L226 Difference]: Without dead ends: 80 [2021-12-15 13:55:54,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:55:54,711 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 221 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:54,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 138 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:55:54,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-15 13:55:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 33. [2021-12-15 13:55:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 32 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) [2021-12-15 13:55:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2021-12-15 13:55:54,713 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 11 [2021-12-15 13:55:54,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:54,714 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2021-12-15 13:55:54,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:54,714 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2021-12-15 13:55:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 13:55:54,714 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:54,714 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:54,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-15 13:55:54,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:55:54,927 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:54,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:54,928 INFO L85 PathProgramCache]: Analyzing trace with hash -467610218, now seen corresponding path program 1 times [2021-12-15 13:55:54,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:54,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911691141] [2021-12-15 13:55:54,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:54,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:54,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:54,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911691141] [2021-12-15 13:55:54,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911691141] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:54,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:54,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:55:54,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334071519] [2021-12-15 13:55:54,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:54,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:55:54,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:54,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:55:54,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:55:54,951 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:54,967 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-12-15 13:55:54,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:55:54,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-12-15 13:55:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:54,968 INFO L225 Difference]: With dead ends: 33 [2021-12-15 13:55:54,968 INFO L226 Difference]: Without dead ends: 33 [2021-12-15 13:55:54,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:55:54,969 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:54,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 59 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:54,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-15 13:55:54,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-12-15 13:55:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2021-12-15 13:55:54,971 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 12 [2021-12-15 13:55:54,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:54,971 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2021-12-15 13:55:54,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:54,971 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2021-12-15 13:55:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 13:55:54,972 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:54,972 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:54,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 13:55:54,972 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1625875758, now seen corresponding path program 1 times [2021-12-15 13:55:54,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:54,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783468610] [2021-12-15 13:55:54,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:54,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:54,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:54,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783468610] [2021-12-15 13:55:54,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783468610] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:55,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:55,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 13:55:55,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950236276] [2021-12-15 13:55:55,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:55,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 13:55:55,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:55,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 13:55:55,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:55:55,001 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:55,020 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2021-12-15 13:55:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 13:55:55,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-12-15 13:55:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:55,020 INFO L225 Difference]: With dead ends: 61 [2021-12-15 13:55:55,021 INFO L226 Difference]: Without dead ends: 61 [2021-12-15 13:55:55,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-15 13:55:55,021 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 53 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:55,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 81 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:55,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-15 13:55:55,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2021-12-15 13:55:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 46 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) [2021-12-15 13:55:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2021-12-15 13:55:55,024 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 14 [2021-12-15 13:55:55,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:55,024 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2021-12-15 13:55:55,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,024 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2021-12-15 13:55:55,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 13:55:55,025 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:55,025 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:55,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 13:55:55,025 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:55,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:55,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1968026960, now seen corresponding path program 1 times [2021-12-15 13:55:55,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:55,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226852561] [2021-12-15 13:55:55,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:55,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:55,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:55,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226852561] [2021-12-15 13:55:55,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226852561] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:55,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:55,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 13:55:55,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790367407] [2021-12-15 13:55:55,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:55,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 13:55:55,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:55,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 13:55:55,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-15 13:55:55,113 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:55,175 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2021-12-15 13:55:55,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 13:55:55,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-12-15 13:55:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:55,176 INFO L225 Difference]: With dead ends: 69 [2021-12-15 13:55:55,176 INFO L226 Difference]: Without dead ends: 69 [2021-12-15 13:55:55,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:55:55,177 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:55,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 149 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:55,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-15 13:55:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2021-12-15 13:55:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 50 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) [2021-12-15 13:55:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2021-12-15 13:55:55,182 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 14 [2021-12-15 13:55:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:55,182 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2021-12-15 13:55:55,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2021-12-15 13:55:55,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 13:55:55,185 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:55,185 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:55,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 13:55:55,185 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:55,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:55,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1709861522, now seen corresponding path program 1 times [2021-12-15 13:55:55,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:55,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261179643] [2021-12-15 13:55:55,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:55,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:55,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:55,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261179643] [2021-12-15 13:55:55,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261179643] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:55,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:55,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 13:55:55,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407056853] [2021-12-15 13:55:55,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:55,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 13:55:55,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:55,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 13:55:55,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-15 13:55:55,298 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:55,386 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2021-12-15 13:55:55,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 13:55:55,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-12-15 13:55:55,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:55,388 INFO L225 Difference]: With dead ends: 81 [2021-12-15 13:55:55,388 INFO L226 Difference]: Without dead ends: 81 [2021-12-15 13:55:55,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-12-15 13:55:55,389 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:55,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 143 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-15 13:55:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2021-12-15 13:55:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2021-12-15 13:55:55,392 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 14 [2021-12-15 13:55:55,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:55,392 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2021-12-15 13:55:55,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,392 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2021-12-15 13:55:55,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 13:55:55,392 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:55,393 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:55,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 13:55:55,393 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:55,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:55,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1138011067, now seen corresponding path program 1 times [2021-12-15 13:55:55,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:55,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202351408] [2021-12-15 13:55:55,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:55,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:55,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:55,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202351408] [2021-12-15 13:55:55,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202351408] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:55,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:55,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 13:55:55,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752622248] [2021-12-15 13:55:55,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:55,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 13:55:55,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:55,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 13:55:55,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 13:55:55,422 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:55,463 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2021-12-15 13:55:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 13:55:55,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 13:55:55,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:55,463 INFO L225 Difference]: With dead ends: 54 [2021-12-15 13:55:55,464 INFO L226 Difference]: Without dead ends: 54 [2021-12-15 13:55:55,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-15 13:55:55,464 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:55,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 79 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-15 13:55:55,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2021-12-15 13:55:55,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2021-12-15 13:55:55,466 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 15 [2021-12-15 13:55:55,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:55,466 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2021-12-15 13:55:55,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,467 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2021-12-15 13:55:55,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 13:55:55,467 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:55,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:55,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 13:55:55,467 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:55,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:55,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1138011066, now seen corresponding path program 1 times [2021-12-15 13:55:55,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:55,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173371054] [2021-12-15 13:55:55,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:55,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:55,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:55,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173371054] [2021-12-15 13:55:55,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173371054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:55,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:55,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 13:55:55,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053574628] [2021-12-15 13:55:55,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:55,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 13:55:55,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:55,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 13:55:55,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-15 13:55:55,532 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:55,583 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2021-12-15 13:55:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 13:55:55,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 13:55:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:55,584 INFO L225 Difference]: With dead ends: 66 [2021-12-15 13:55:55,584 INFO L226 Difference]: Without dead ends: 66 [2021-12-15 13:55:55,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-15 13:55:55,585 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:55,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 147 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-15 13:55:55,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2021-12-15 13:55:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2021-12-15 13:55:55,587 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 15 [2021-12-15 13:55:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:55,587 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2021-12-15 13:55:55,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2021-12-15 13:55:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 13:55:55,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:55,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:55,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 13:55:55,588 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:55,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash -879845628, now seen corresponding path program 1 times [2021-12-15 13:55:55,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:55,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043985740] [2021-12-15 13:55:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:55,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:55,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:55,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043985740] [2021-12-15 13:55:55,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043985740] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:55,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:55,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-15 13:55:55,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442914449] [2021-12-15 13:55:55,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:55,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 13:55:55,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:55,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 13:55:55,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-15 13:55:55,740 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:55,965 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2021-12-15 13:55:55,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 13:55:55,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 13:55:55,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:55,966 INFO L225 Difference]: With dead ends: 89 [2021-12-15 13:55:55,966 INFO L226 Difference]: Without dead ends: 89 [2021-12-15 13:55:55,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2021-12-15 13:55:55,967 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:55,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 170 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:55:55,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-15 13:55:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2021-12-15 13:55:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 70 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2021-12-15 13:55:55,969 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 15 [2021-12-15 13:55:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:55,969 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2021-12-15 13:55:55,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2021-12-15 13:55:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 13:55:55,973 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:55,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:55,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 13:55:55,974 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:55,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:55,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1466651642, now seen corresponding path program 1 times [2021-12-15 13:55:55,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:55,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338964053] [2021-12-15 13:55:55,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:55,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:56,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:56,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338964053] [2021-12-15 13:55:56,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338964053] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:56,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:56,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 13:55:56,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689873506] [2021-12-15 13:55:56,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:56,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 13:55:56,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:56,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 13:55:56,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-15 13:55:56,121 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:56,269 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2021-12-15 13:55:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 13:55:56,269 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 13:55:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:56,270 INFO L225 Difference]: With dead ends: 76 [2021-12-15 13:55:56,270 INFO L226 Difference]: Without dead ends: 76 [2021-12-15 13:55:56,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-12-15 13:55:56,270 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 77 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:56,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 101 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:55:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-15 13:55:56,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2021-12-15 13:55:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 64 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) [2021-12-15 13:55:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2021-12-15 13:55:56,272 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 15 [2021-12-15 13:55:56,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:56,272 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2021-12-15 13:55:56,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2021-12-15 13:55:56,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 13:55:56,273 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:56,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:56,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-15 13:55:56,273 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:56,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1587978612, now seen corresponding path program 1 times [2021-12-15 13:55:56,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:56,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552633365] [2021-12-15 13:55:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:56,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:56,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:56,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552633365] [2021-12-15 13:55:56,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552633365] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:55:56,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:55:56,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 13:55:56,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572274135] [2021-12-15 13:55:56,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:55:56,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 13:55:56,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:56,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 13:55:56,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-15 13:55:56,386 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:56,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:56,443 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2021-12-15 13:55:56,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 13:55:56,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-12-15 13:55:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:56,445 INFO L225 Difference]: With dead ends: 64 [2021-12-15 13:55:56,445 INFO L226 Difference]: Without dead ends: 38 [2021-12-15 13:55:56,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-15 13:55:56,446 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 56 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:56,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 54 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:55:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-15 13:55:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-15 13:55:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-12-15 13:55:56,453 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 17 [2021-12-15 13:55:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:56,453 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-12-15 13:55:56,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-12-15 13:55:56,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 13:55:56,454 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:56,454 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:56,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-15 13:55:56,454 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:56,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:56,455 INFO L85 PathProgramCache]: Analyzing trace with hash 980027851, now seen corresponding path program 1 times [2021-12-15 13:55:56,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:56,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28828507] [2021-12-15 13:55:56,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:56,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:56,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:56,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28828507] [2021-12-15 13:55:56,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28828507] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:55:56,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470328939] [2021-12-15 13:55:56,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:56,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:55:56,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:55:56,540 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:55:56,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 13:55:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:56,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-15 13:55:56,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:55:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:56,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:55:56,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 13:55:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:56,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470328939] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:55:56,827 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:55:56,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2021-12-15 13:55:56,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777879671] [2021-12-15 13:55:56,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:55:56,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-15 13:55:56,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:56,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-15 13:55:56,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-12-15 13:55:56,828 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:55:57,018 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2021-12-15 13:55:57,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 13:55:57,019 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 13:55:57,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:55:57,019 INFO L225 Difference]: With dead ends: 63 [2021-12-15 13:55:57,019 INFO L226 Difference]: Without dead ends: 63 [2021-12-15 13:55:57,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2021-12-15 13:55:57,020 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 126 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:55:57,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 116 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:55:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-15 13:55:57,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2021-12-15 13:55:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2021-12-15 13:55:57,022 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 18 [2021-12-15 13:55:57,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:55:57,022 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2021-12-15 13:55:57,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:55:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2021-12-15 13:55:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 13:55:57,022 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:55:57,022 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:55:57,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 13:55:57,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:55:57,223 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:55:57,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:55:57,223 INFO L85 PathProgramCache]: Analyzing trace with hash 358816956, now seen corresponding path program 1 times [2021-12-15 13:55:57,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:55:57,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053731203] [2021-12-15 13:55:57,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:57,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:55:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:57,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:55:57,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053731203] [2021-12-15 13:55:57,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053731203] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:55:57,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383455543] [2021-12-15 13:55:57,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:55:57,415 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:55:57,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:55:57,416 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:55:57,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 13:55:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:55:57,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-15 13:55:57,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:55:57,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:55:57,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-15 13:55:57,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:55:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:57,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:55:58,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 13:55:58,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:55:58,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383455543] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:55:58,169 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:55:58,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2021-12-15 13:55:58,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022761384] [2021-12-15 13:55:58,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:55:58,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-15 13:55:58,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:55:58,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-15 13:55:58,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2021-12-15 13:55:58,171 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:01,179 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2021-12-15 13:56:01,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-15 13:56:01,183 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 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 [2021-12-15 13:56:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:01,183 INFO L225 Difference]: With dead ends: 71 [2021-12-15 13:56:01,183 INFO L226 Difference]: Without dead ends: 24 [2021-12-15 13:56:01,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=738, Invalid=3552, Unknown=0, NotChecked=0, Total=4290 [2021-12-15 13:56:01,185 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 256 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:01,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 203 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 13:56:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-15 13:56:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-12-15 13:56:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 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) [2021-12-15 13:56:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-12-15 13:56:01,186 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2021-12-15 13:56:01,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:01,186 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-12-15 13:56:01,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:01,187 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2021-12-15 13:56:01,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 13:56:01,187 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:01,187 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:01,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-15 13:56:01,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:01,395 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:01,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash 316092298, now seen corresponding path program 1 times [2021-12-15 13:56:01,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:01,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871018176] [2021-12-15 13:56:01,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:01,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:01,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 13:56:01,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:01,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871018176] [2021-12-15 13:56:01,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871018176] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:01,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418595062] [2021-12-15 13:56:01,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:01,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:01,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:01,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:01,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 13:56:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:01,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-15 13:56:01,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:01,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 13:56:01,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-15 13:56:01,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:56:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 13:56:01,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 13:56:01,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418595062] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:01,835 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:01,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2021-12-15 13:56:01,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077019045] [2021-12-15 13:56:01,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:01,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 13:56:01,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:01,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 13:56:01,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2021-12-15 13:56:01,836 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:01,962 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2021-12-15 13:56:01,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 13:56:01,962 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-15 13:56:01,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:01,962 INFO L225 Difference]: With dead ends: 25 [2021-12-15 13:56:01,962 INFO L226 Difference]: Without dead ends: 25 [2021-12-15 13:56:01,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2021-12-15 13:56:01,963 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 49 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:01,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 74 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:56:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-15 13:56:01,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2021-12-15 13:56:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-12-15 13:56:01,964 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2021-12-15 13:56:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:01,964 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-12-15 13:56:01,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:01,964 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-12-15 13:56:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 13:56:01,964 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:01,964 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:01,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 13:56:02,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:02,165 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:02,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:02,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2137348900, now seen corresponding path program 2 times [2021-12-15 13:56:02,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:02,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548505623] [2021-12-15 13:56:02,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:02,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:02,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:02,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548505623] [2021-12-15 13:56:02,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548505623] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:02,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536787633] [2021-12-15 13:56:02,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:56:02,462 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:02,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:02,476 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:02,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 13:56:02,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:56:02,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:02,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-15 13:56:02,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:02,554 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:56:02,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 13:56:02,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:56:02,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-12-15 13:56:02,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:56:02,982 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:02,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2021-12-15 13:56:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:03,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:03,369 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| Int) (v_ArrVal_252 (Array Int Int))) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_252) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 1))) (< |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 3) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (< |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 0))) is different from false [2021-12-15 13:56:03,386 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| Int) (v_ArrVal_252 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 3) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_252) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 1))) (< |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|))) is different from false [2021-12-15 13:56:03,402 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:03,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-15 13:56:03,408 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:03,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2021-12-15 13:56:03,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:56:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-15 13:56:03,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536787633] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:03,677 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:03,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2021-12-15 13:56:03,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517749748] [2021-12-15 13:56:03,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:03,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-15 13:56:03,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:03,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-15 13:56:03,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=948, Unknown=2, NotChecked=126, Total=1190 [2021-12-15 13:56:03,678 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 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) [2021-12-15 13:56:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:04,191 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2021-12-15 13:56:04,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-15 13:56:04,193 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 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) Word has length 22 [2021-12-15 13:56:04,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:04,193 INFO L225 Difference]: With dead ends: 46 [2021-12-15 13:56:04,193 INFO L226 Difference]: Without dead ends: 36 [2021-12-15 13:56:04,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=1832, Unknown=2, NotChecked=178, Total=2256 [2021-12-15 13:56:04,194 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 47 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:04,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 135 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 191 Invalid, 0 Unknown, 140 Unchecked, 0.1s Time] [2021-12-15 13:56:04,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-15 13:56:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2021-12-15 13:56:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-12-15 13:56:04,195 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 22 [2021-12-15 13:56:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:04,196 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-12-15 13:56:04,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 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) [2021-12-15 13:56:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2021-12-15 13:56:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-15 13:56:04,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:04,196 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:04,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 13:56:04,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-15 13:56:04,397 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:04,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash 269887706, now seen corresponding path program 3 times [2021-12-15 13:56:04,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:04,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915272426] [2021-12-15 13:56:04,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:04,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:04,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:04,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915272426] [2021-12-15 13:56:04,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915272426] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:04,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178457439] [2021-12-15 13:56:04,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 13:56:04,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:04,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:04,640 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:04,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 13:56:04,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-15 13:56:04,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:04,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 74 conjunts are in the unsatisfiable core [2021-12-15 13:56:04,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:04,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:56:04,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-12-15 13:56:05,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:56:05,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 13:56:05,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 13:56:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:05,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:05,146 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2021-12-15 13:56:05,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:05,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_291) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:05,173 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:05,178 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:05,184 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:05,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-15 13:56:05,188 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:05,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2021-12-15 13:56:05,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:56:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2021-12-15 13:56:05,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178457439] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:05,384 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:05,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 33 [2021-12-15 13:56:05,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467589858] [2021-12-15 13:56:05,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:05,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-15 13:56:05,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:05,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-15 13:56:05,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=678, Unknown=5, NotChecked=280, Total=1056 [2021-12-15 13:56:05,385 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:05,661 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2021-12-15 13:56:05,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 13:56:05,661 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 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 [2021-12-15 13:56:05,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:05,661 INFO L225 Difference]: With dead ends: 52 [2021-12-15 13:56:05,661 INFO L226 Difference]: Without dead ends: 38 [2021-12-15 13:56:05,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=1060, Unknown=5, NotChecked=350, Total=1560 [2021-12-15 13:56:05,662 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:05,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 148 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 0 Unknown, 153 Unchecked, 0.1s Time] [2021-12-15 13:56:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-15 13:56:05,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2021-12-15 13:56:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2021-12-15 13:56:05,663 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2021-12-15 13:56:05,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:05,663 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-12-15 13:56:05,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2021-12-15 13:56:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 13:56:05,664 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:05,664 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:05,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-15 13:56:05,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:05,864 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:05,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:05,865 INFO L85 PathProgramCache]: Analyzing trace with hash -826784969, now seen corresponding path program 4 times [2021-12-15 13:56:05,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:05,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675761978] [2021-12-15 13:56:05,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:05,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:06,001 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:06,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:06,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675761978] [2021-12-15 13:56:06,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675761978] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:06,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584064777] [2021-12-15 13:56:06,002 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 13:56:06,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:06,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:06,003 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:06,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-15 13:56:06,081 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 13:56:06,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:06,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 78 conjunts are in the unsatisfiable core [2021-12-15 13:56:06,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:06,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:56:06,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-15 13:56:06,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-15 13:56:06,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-12-15 13:56:06,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-12-15 13:56:06,683 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:06,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-15 13:56:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:06,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:07,179 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_338 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_38| Int)) (or (< |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_38|) (< |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_38| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_38| 2))) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_38| 4) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2021-12-15 13:56:07,193 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_338 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_38| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_38| 2))) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_38|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_38| 4) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_38| 0))) is different from false [2021-12-15 13:56:07,202 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:07,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-15 13:56:07,209 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:07,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2021-12-15 13:56:07,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:56:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-15 13:56:07,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584064777] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:07,811 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:07,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 41 [2021-12-15 13:56:07,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631483621] [2021-12-15 13:56:07,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:07,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-15 13:56:07,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:07,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-15 13:56:07,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1386, Unknown=3, NotChecked=154, Total=1722 [2021-12-15 13:56:07,813 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:08,354 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2021-12-15 13:56:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 13:56:08,355 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-15 13:56:08,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:08,355 INFO L225 Difference]: With dead ends: 41 [2021-12-15 13:56:08,355 INFO L226 Difference]: Without dead ends: 41 [2021-12-15 13:56:08,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=367, Invalid=2500, Unknown=3, NotChecked=210, Total=3080 [2021-12-15 13:56:08,356 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:08,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 195 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 258 Invalid, 0 Unknown, 220 Unchecked, 0.1s Time] [2021-12-15 13:56:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-15 13:56:08,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2021-12-15 13:56:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 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) [2021-12-15 13:56:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2021-12-15 13:56:08,357 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2021-12-15 13:56:08,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:08,357 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2021-12-15 13:56:08,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2021-12-15 13:56:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 13:56:08,358 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:08,358 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:08,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-15 13:56:08,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:08,558 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:08,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:08,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1709244048, now seen corresponding path program 5 times [2021-12-15 13:56:08,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:08,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531197584] [2021-12-15 13:56:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:08,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:08,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:08,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531197584] [2021-12-15 13:56:08,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531197584] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:08,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747235572] [2021-12-15 13:56:08,910 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 13:56:08,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:08,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:08,912 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:08,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-15 13:56:09,002 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-15 13:56:09,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:09,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 83 conjunts are in the unsatisfiable core [2021-12-15 13:56:09,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:09,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:56:09,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-12-15 13:56:09,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:56:09,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:09,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 13:56:09,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 13:56:09,395 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:09,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:09,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_386 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_386) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2021-12-15 13:56:09,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_386 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:09,438 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_385) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:09,444 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_386 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:09,451 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_386 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_384) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:09,458 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_386 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:09,462 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_386 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:09,467 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:09,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-15 13:56:09,472 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:09,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2021-12-15 13:56:09,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:56:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 23 not checked. [2021-12-15 13:56:09,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747235572] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:09,659 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:09,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 40 [2021-12-15 13:56:09,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809850641] [2021-12-15 13:56:09,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:09,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-15 13:56:09,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:09,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-15 13:56:09,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=965, Unknown=7, NotChecked=476, Total=1560 [2021-12-15 13:56:09,660 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:10,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:10,048 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2021-12-15 13:56:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-15 13:56:10,049 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-15 13:56:10,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:10,049 INFO L225 Difference]: With dead ends: 64 [2021-12-15 13:56:10,049 INFO L226 Difference]: Without dead ends: 46 [2021-12-15 13:56:10,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 51 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=1494, Unknown=7, NotChecked=588, Total=2256 [2021-12-15 13:56:10,050 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:10,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 229 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 361 Invalid, 0 Unknown, 232 Unchecked, 0.1s Time] [2021-12-15 13:56:10,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-15 13:56:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2021-12-15 13:56:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 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) [2021-12-15 13:56:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-12-15 13:56:10,051 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2021-12-15 13:56:10,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:10,051 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-12-15 13:56:10,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-12-15 13:56:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 13:56:10,052 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:10,052 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:10,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-15 13:56:10,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-15 13:56:10,252 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash 849701869, now seen corresponding path program 6 times [2021-12-15 13:56:10,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:10,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477026632] [2021-12-15 13:56:10,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:10,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:10,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:10,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477026632] [2021-12-15 13:56:10,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477026632] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:10,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198499035] [2021-12-15 13:56:10,434 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 13:56:10,434 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:10,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:10,435 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:10,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-15 13:56:10,530 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-15 13:56:10,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:10,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-15 13:56:10,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:10,550 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:56:10,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 13:56:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:10,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:11,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198499035] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:11,141 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:11,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 33 [2021-12-15 13:56:11,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019047461] [2021-12-15 13:56:11,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:11,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-15 13:56:11,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:11,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-15 13:56:11,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2021-12-15 13:56:11,144 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 34 states, 33 states have (on average 3.393939393939394) internal successors, (112), 34 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:11,569 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2021-12-15 13:56:11,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 13:56:11,570 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.393939393939394) internal successors, (112), 34 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-15 13:56:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:11,570 INFO L225 Difference]: With dead ends: 49 [2021-12-15 13:56:11,570 INFO L226 Difference]: Without dead ends: 49 [2021-12-15 13:56:11,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=404, Invalid=1666, Unknown=0, NotChecked=0, Total=2070 [2021-12-15 13:56:11,571 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 187 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:11,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 140 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 13:56:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-15 13:56:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2021-12-15 13:56:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2021-12-15 13:56:11,572 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2021-12-15 13:56:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:11,572 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2021-12-15 13:56:11,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.393939393939394) internal successors, (112), 34 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2021-12-15 13:56:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-15 13:56:11,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:11,572 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:11,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-15 13:56:11,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-15 13:56:11,783 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:11,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:11,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1224662086, now seen corresponding path program 7 times [2021-12-15 13:56:11,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:11,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986217521] [2021-12-15 13:56:11,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:11,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:12,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:12,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986217521] [2021-12-15 13:56:12,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986217521] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:12,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130243526] [2021-12-15 13:56:12,179 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-15 13:56:12,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:12,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:12,180 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:12,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-15 13:56:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:12,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 102 conjunts are in the unsatisfiable core [2021-12-15 13:56:12,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:12,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:56:12,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-12-15 13:56:12,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 13:56:12,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 13:56:12,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 13:56:12,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 13:56:12,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 13:56:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:12,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:12,778 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2021-12-15 13:56:12,788 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:12,794 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_490) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:12,800 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:12,806 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:12,813 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:12,820 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:12,826 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:56:12,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:56:12,835 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:12,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-15 13:56:12,840 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:12,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2021-12-15 13:56:12,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:56:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2021-12-15 13:56:13,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130243526] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:13,112 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:13,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 51 [2021-12-15 13:56:13,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30850316] [2021-12-15 13:56:13,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:13,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-15 13:56:13,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:13,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-15 13:56:13,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1601, Unknown=9, NotChecked=792, Total=2550 [2021-12-15 13:56:13,114 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 51 states, 51 states have (on average 2.019607843137255) internal successors, (103), 51 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:13,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:13,760 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2021-12-15 13:56:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-15 13:56:13,761 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.019607843137255) internal successors, (103), 51 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-12-15 13:56:13,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:13,761 INFO L225 Difference]: With dead ends: 76 [2021-12-15 13:56:13,761 INFO L226 Difference]: Without dead ends: 54 [2021-12-15 13:56:13,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 62 SyntacticMatches, 12 SemanticMatches, 60 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=2560, Unknown=9, NotChecked=990, Total=3782 [2021-12-15 13:56:13,762 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 37 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 392 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:13,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 354 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 755 Invalid, 0 Unknown, 392 Unchecked, 0.2s Time] [2021-12-15 13:56:13,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-15 13:56:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2021-12-15 13:56:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2021-12-15 13:56:13,763 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2021-12-15 13:56:13,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:13,763 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2021-12-15 13:56:13,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.019607843137255) internal successors, (103), 51 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:13,764 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2021-12-15 13:56:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-15 13:56:13,764 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:13,764 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:13,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-15 13:56:13,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-15 13:56:13,964 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:13,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:13,965 INFO L85 PathProgramCache]: Analyzing trace with hash 300063907, now seen corresponding path program 8 times [2021-12-15 13:56:13,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:13,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136460468] [2021-12-15 13:56:13,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:13,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:14,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:14,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136460468] [2021-12-15 13:56:14,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136460468] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:14,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324682385] [2021-12-15 13:56:14,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:56:14,202 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:14,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:14,203 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:14,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-15 13:56:14,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:56:14,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:14,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-15 13:56:14,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:14,328 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:56:14,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 13:56:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:14,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:15,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324682385] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:15,180 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:15,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 44 [2021-12-15 13:56:15,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020060743] [2021-12-15 13:56:15,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:15,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-15 13:56:15,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:15,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-15 13:56:15,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1738, Unknown=0, NotChecked=0, Total=1980 [2021-12-15 13:56:15,181 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:15,653 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2021-12-15 13:56:15,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 13:56:15,654 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 states have internal predecessors, (142), 0 states have call successors, (0), 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 50 [2021-12-15 13:56:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:15,654 INFO L225 Difference]: With dead ends: 57 [2021-12-15 13:56:15,654 INFO L226 Difference]: Without dead ends: 57 [2021-12-15 13:56:15,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=618, Invalid=2804, Unknown=0, NotChecked=0, Total=3422 [2021-12-15 13:56:15,655 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 154 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:15,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 225 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 13:56:15,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-15 13:56:15,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2021-12-15 13:56:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 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) [2021-12-15 13:56:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2021-12-15 13:56:15,666 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2021-12-15 13:56:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:15,666 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2021-12-15 13:56:15,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2021-12-15 13:56:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-15 13:56:15,667 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:15,667 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:15,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-15 13:56:15,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-15 13:56:15,879 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:15,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:15,880 INFO L85 PathProgramCache]: Analyzing trace with hash -265764356, now seen corresponding path program 9 times [2021-12-15 13:56:15,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:15,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692411836] [2021-12-15 13:56:15,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:15,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:16,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:16,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692411836] [2021-12-15 13:56:16,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692411836] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:16,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193029221] [2021-12-15 13:56:16,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 13:56:16,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:16,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:16,394 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:16,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-15 13:56:16,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-12-15 13:56:16,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:16,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 153 conjunts are in the unsatisfiable core [2021-12-15 13:56:16,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:16,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:56:16,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-12-15 13:56:17,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:17,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:17,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:17,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:17,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:17,646 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 13:56:17,647 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:17,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2021-12-15 13:56:17,653 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:17,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:17,671 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_613) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2021-12-15 13:56:17,675 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:17,679 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_613 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_612) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:17,683 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:17,687 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_613 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_611) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:17,691 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:17,695 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_610) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:17,700 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:56:17,705 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_609) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:56:17,710 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 5)) 0)) is different from false [2021-12-15 13:56:17,713 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 5)) 0)) is different from false [2021-12-15 13:56:17,716 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:17,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-15 13:56:17,719 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:17,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2021-12-15 13:56:17,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:56:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 59 not checked. [2021-12-15 13:56:17,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193029221] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:17,953 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:17,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 69 [2021-12-15 13:56:17,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394147788] [2021-12-15 13:56:17,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:17,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2021-12-15 13:56:17,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:17,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-12-15 13:56:17,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=3127, Unknown=11, NotChecked=1342, Total=4692 [2021-12-15 13:56:17,954 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:18,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:18,610 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2021-12-15 13:56:18,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-15 13:56:18,611 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 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 54 [2021-12-15 13:56:18,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:18,611 INFO L225 Difference]: With dead ends: 88 [2021-12-15 13:56:18,611 INFO L226 Difference]: Without dead ends: 62 [2021-12-15 13:56:18,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 11 IntricatePredicates, 1 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=321, Invalid=4968, Unknown=11, NotChecked=1672, Total=6972 [2021-12-15 13:56:18,613 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 48 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 571 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:18,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 449 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 611 Invalid, 0 Unknown, 571 Unchecked, 0.1s Time] [2021-12-15 13:56:18,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-15 13:56:18,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2021-12-15 13:56:18,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 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) [2021-12-15 13:56:18,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2021-12-15 13:56:18,614 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2021-12-15 13:56:18,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:18,614 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2021-12-15 13:56:18,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2021-12-15 13:56:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-15 13:56:18,614 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:18,614 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:18,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-15 13:56:18,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-15 13:56:18,827 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1445516633, now seen corresponding path program 10 times [2021-12-15 13:56:18,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:18,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171785937] [2021-12-15 13:56:18,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:18,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 28 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:19,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:19,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171785937] [2021-12-15 13:56:19,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171785937] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:19,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559274974] [2021-12-15 13:56:19,035 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 13:56:19,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:19,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:19,036 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:19,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-15 13:56:19,125 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 13:56:19,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:19,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 120 conjunts are in the unsatisfiable core [2021-12-15 13:56:19,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:19,166 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:56:19,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 13:56:19,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:56:19,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-15 13:56:19,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 13:56:19,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 13:56:19,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 13:56:19,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 13:56:19,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 13:56:19,869 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:19,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2021-12-15 13:56:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:19,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:20,758 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_110| Int) (v_ArrVal_685 (Array Int Int))) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_685) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_110| 5))) (< |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_110|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_110| 7) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (< |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_110| 0))) is different from false [2021-12-15 13:56:20,771 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_110| Int) (v_ArrVal_685 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_110| 7) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_685) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_110| 5))) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_110|) (< |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_110| 0))) is different from false [2021-12-15 13:56:20,780 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:20,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-15 13:56:20,785 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:20,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2021-12-15 13:56:20,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:56:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-12-15 13:56:21,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559274974] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:21,801 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:21,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 25] total 66 [2021-12-15 13:56:21,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71752982] [2021-12-15 13:56:21,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:21,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2021-12-15 13:56:21,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:21,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-12-15 13:56:21,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=3727, Unknown=6, NotChecked=254, Total=4422 [2021-12-15 13:56:21,804 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:23,080 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) (.cse1 (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|))) (and (<= .cse0 .cse1) (or (not (= .cse1 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (= 0 |c_ULTIMATE.start_cstrncpy_#t~mem5#1|)) (<= |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 6) (<= 6 .cse1) (<= 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) (or (forall ((v_ArrVal_685 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_685) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|))) (and (<= 0 .cse0) (<= (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 2) .cse1))))) is different from false [2021-12-15 13:56:23,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:23,269 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2021-12-15 13:56:23,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-15 13:56:23,270 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 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 58 [2021-12-15 13:56:23,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:23,270 INFO L225 Difference]: With dead ends: 67 [2021-12-15 13:56:23,270 INFO L226 Difference]: Without dead ends: 67 [2021-12-15 13:56:23,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1135, Invalid=6681, Unknown=28, NotChecked=528, Total=8372 [2021-12-15 13:56:23,272 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 94 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 437 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:23,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 319 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 699 Invalid, 0 Unknown, 437 Unchecked, 0.3s Time] [2021-12-15 13:56:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-15 13:56:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-15 13:56:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2021-12-15 13:56:23,273 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 58 [2021-12-15 13:56:23,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:23,273 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2021-12-15 13:56:23,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:23,273 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2021-12-15 13:56:23,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-15 13:56:23,274 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:23,274 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:23,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-15 13:56:23,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:23,483 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:23,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1223669131, now seen corresponding path program 11 times [2021-12-15 13:56:23,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:23,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170516686] [2021-12-15 13:56:23,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:23,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 108 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:23,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:23,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170516686] [2021-12-15 13:56:23,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170516686] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:23,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333425756] [2021-12-15 13:56:23,686 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 13:56:23,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:23,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:23,691 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:23,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-15 13:56:24,109 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-12-15 13:56:24,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:24,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-15 13:56:24,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:24,134 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:56:24,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 13:56:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 121 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:24,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 121 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:24,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333425756] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:24,999 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:25,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 46 [2021-12-15 13:56:25,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843898275] [2021-12-15 13:56:25,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:25,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-15 13:56:25,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:25,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-15 13:56:25,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1734, Unknown=0, NotChecked=0, Total=2070 [2021-12-15 13:56:25,001 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 46 states, 46 states have (on average 3.347826086956522) internal successors, (154), 46 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:25,501 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2021-12-15 13:56:25,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 13:56:25,501 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.347826086956522) internal successors, (154), 46 states have internal predecessors, (154), 0 states have call successors, (0), 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 66 [2021-12-15 13:56:25,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:25,502 INFO L225 Difference]: With dead ends: 106 [2021-12-15 13:56:25,502 INFO L226 Difference]: Without dead ends: 74 [2021-12-15 13:56:25,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=732, Invalid=3174, Unknown=0, NotChecked=0, Total=3906 [2021-12-15 13:56:25,503 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 97 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:25,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 147 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 13:56:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-15 13:56:25,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2021-12-15 13:56:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2021-12-15 13:56:25,504 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2021-12-15 13:56:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:25,504 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2021-12-15 13:56:25,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.347826086956522) internal successors, (154), 46 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2021-12-15 13:56:25,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 13:56:25,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:25,505 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:25,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-15 13:56:25,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:25,719 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:25,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:25,720 INFO L85 PathProgramCache]: Analyzing trace with hash 235185512, now seen corresponding path program 12 times [2021-12-15 13:56:25,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:25,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946575474] [2021-12-15 13:56:25,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:25,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:26,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:26,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946575474] [2021-12-15 13:56:26,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946575474] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:26,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687591879] [2021-12-15 13:56:26,493 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 13:56:26,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:26,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:26,507 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:26,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-15 13:56:26,887 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-12-15 13:56:26,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:26,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 189 conjunts are in the unsatisfiable core [2021-12-15 13:56:26,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:26,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:56:27,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-12-15 13:56:27,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:27,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:27,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:27,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:28,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:28,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:28,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:28,505 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 13:56:28,507 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:28,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2021-12-15 13:56:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:28,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:28,554 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_842) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2021-12-15 13:56:28,561 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:28,567 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_841 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_841) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:28,574 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:28,580 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_840) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:28,586 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:28,592 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_839 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_839) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:28,598 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:56:28,604 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_838) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:56:28,611 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 5)) 0)) is different from false [2021-12-15 13:56:28,617 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_837 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_837) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 5)) 0)) is different from false [2021-12-15 13:56:28,623 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 6)) 0)) is different from false [2021-12-15 13:56:28,629 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_836 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_836) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 6)) 0)) is different from false [2021-12-15 13:56:28,635 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 7)) 0)) is different from false [2021-12-15 13:56:28,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 7)) 0)) is different from false [2021-12-15 13:56:28,643 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:28,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-15 13:56:28,648 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:28,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2021-12-15 13:56:28,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:56:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 111 not checked. [2021-12-15 13:56:29,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687591879] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:29,165 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:29,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30, 30] total 89 [2021-12-15 13:56:29,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17211759] [2021-12-15 13:56:29,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:29,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2021-12-15 13:56:29,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:29,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2021-12-15 13:56:29,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=5175, Unknown=15, NotChecked=2370, Total=7832 [2021-12-15 13:56:29,167 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 89 states, 89 states have (on average 2.146067415730337) internal successors, (191), 89 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:30,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:30,405 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2021-12-15 13:56:30,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-12-15 13:56:30,405 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 2.146067415730337) internal successors, (191), 89 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-12-15 13:56:30,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:30,405 INFO L225 Difference]: With dead ends: 112 [2021-12-15 13:56:30,405 INFO L226 Difference]: Without dead ends: 78 [2021-12-15 13:56:30,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 87 SyntacticMatches, 15 SemanticMatches, 102 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=378, Invalid=7499, Unknown=15, NotChecked=2820, Total=10712 [2021-12-15 13:56:30,406 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 733 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:30,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 741 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 771 Invalid, 0 Unknown, 733 Unchecked, 0.3s Time] [2021-12-15 13:56:30,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-15 13:56:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2021-12-15 13:56:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 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) [2021-12-15 13:56:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2021-12-15 13:56:30,408 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2021-12-15 13:56:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:30,408 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2021-12-15 13:56:30,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 2.146067415730337) internal successors, (191), 89 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2021-12-15 13:56:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-15 13:56:30,408 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:30,408 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:30,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-15 13:56:30,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:30,609 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:30,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:30,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1563713221, now seen corresponding path program 13 times [2021-12-15 13:56:30,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:30,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835001774] [2021-12-15 13:56:30,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:30,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 66 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:30,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:30,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835001774] [2021-12-15 13:56:30,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835001774] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:30,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632304461] [2021-12-15 13:56:30,877 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-15 13:56:30,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:30,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:30,884 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:30,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-15 13:56:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:31,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 90 conjunts are in the unsatisfiable core [2021-12-15 13:56:31,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 91 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:31,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:31,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 13:56:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 91 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:31,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632304461] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:31,840 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:31,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 45 [2021-12-15 13:56:31,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752571945] [2021-12-15 13:56:31,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:31,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-15 13:56:31,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:31,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-15 13:56:31,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1866, Unknown=0, NotChecked=0, Total=2070 [2021-12-15 13:56:31,841 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 46 states, 45 states have (on average 3.2888888888888888) internal successors, (148), 46 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:32,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:32,758 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2021-12-15 13:56:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-15 13:56:32,758 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.2888888888888888) internal successors, (148), 46 states have internal predecessors, (148), 0 states have call successors, (0), 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 74 [2021-12-15 13:56:32,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:32,759 INFO L225 Difference]: With dead ends: 81 [2021-12-15 13:56:32,759 INFO L226 Difference]: Without dead ends: 81 [2021-12-15 13:56:32,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1013, Invalid=4243, Unknown=0, NotChecked=0, Total=5256 [2021-12-15 13:56:32,760 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 279 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:32,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 324 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 13:56:32,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-15 13:56:32,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2021-12-15 13:56:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2021-12-15 13:56:32,761 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2021-12-15 13:56:32,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:32,762 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2021-12-15 13:56:32,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.2888888888888888) internal successors, (148), 46 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2021-12-15 13:56:32,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-15 13:56:32,762 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:32,762 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:32,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-15 13:56:32,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-15 13:56:32,982 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:32,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:32,982 INFO L85 PathProgramCache]: Analyzing trace with hash -626482402, now seen corresponding path program 14 times [2021-12-15 13:56:32,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:32,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125516537] [2021-12-15 13:56:32,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:32,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:33,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:33,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125516537] [2021-12-15 13:56:33,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125516537] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:33,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494362239] [2021-12-15 13:56:33,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 13:56:33,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:33,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:33,803 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:33,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-15 13:56:33,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 13:56:33,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:33,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 160 conjunts are in the unsatisfiable core [2021-12-15 13:56:33,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:33,971 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:56:33,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 13:56:33,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:56:34,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-12-15 13:56:34,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:56:34,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:56:35,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:56:35,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:56:35,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:56:35,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:56:36,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:56:36,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:56:36,432 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:36,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2021-12-15 13:56:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 91 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:36,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:38,229 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_184| Int) (v_ArrVal_1016 (Array Int Int))) (or (< |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_184|) (< |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_184| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_184| 8))) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_184| 10) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2021-12-15 13:56:38,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_184| Int) (v_ArrVal_1016 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_184| 10) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_184| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_184| 8))) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_184|))) is different from false [2021-12-15 13:56:38,244 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:38,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-15 13:56:38,249 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:38,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2021-12-15 13:56:38,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:56:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 120 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-15 13:56:39,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494362239] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:39,814 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:39,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 33, 33] total 105 [2021-12-15 13:56:39,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323304170] [2021-12-15 13:56:39,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:39,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2021-12-15 13:56:39,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:39,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2021-12-15 13:56:39,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=9905, Unknown=9, NotChecked=406, Total=10920 [2021-12-15 13:56:39,816 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 105 states, 105 states have (on average 2.1523809523809523) internal successors, (226), 105 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:43,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:43,365 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2021-12-15 13:56:43,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-12-15 13:56:43,366 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 2.1523809523809523) internal successors, (226), 105 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-12-15 13:56:43,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:43,367 INFO L225 Difference]: With dead ends: 130 [2021-12-15 13:56:43,367 INFO L226 Difference]: Without dead ends: 92 [2021-12-15 13:56:43,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 3871 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1448, Invalid=21503, Unknown=9, NotChecked=602, Total=23562 [2021-12-15 13:56:43,368 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 51 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 840 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:43,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 945 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 963 Invalid, 0 Unknown, 840 Unchecked, 0.3s Time] [2021-12-15 13:56:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-15 13:56:43,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2021-12-15 13:56:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2021-12-15 13:56:43,370 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 78 [2021-12-15 13:56:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:43,370 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2021-12-15 13:56:43,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 2.1523809523809523) internal successors, (226), 105 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2021-12-15 13:56:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-15 13:56:43,371 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:43,371 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:43,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-15 13:56:43,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:43,598 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:43,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:43,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1757632300, now seen corresponding path program 15 times [2021-12-15 13:56:43,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:43,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947298750] [2021-12-15 13:56:43,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:43,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:44,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:44,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947298750] [2021-12-15 13:56:44,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947298750] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:44,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264854593] [2021-12-15 13:56:44,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 13:56:44,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:44,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:44,715 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:44,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-15 13:56:45,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-15 13:56:45,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:45,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 177 conjunts are in the unsatisfiable core [2021-12-15 13:56:45,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:45,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:56:45,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-12-15 13:56:45,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-15 13:56:45,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:46,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:46,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:46,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:46,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:46,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:46,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 13:56:46,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 13:56:46,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 13:56:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:46,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:46,382 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2021-12-15 13:56:46,387 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:46,391 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1117 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1117) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2021-12-15 13:56:46,395 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:46,399 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1116 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1116) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 2)) 0)) is different from false [2021-12-15 13:56:46,403 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:46,407 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1115 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1115) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 3)) 0)) is different from false [2021-12-15 13:56:46,411 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:56:46,415 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1114 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1114) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 4)) 0)) is different from false [2021-12-15 13:56:46,422 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 5)) 0)) is different from false [2021-12-15 13:56:46,445 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1113) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 5)) 0)) is different from false [2021-12-15 13:56:46,449 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 6)) 0)) is different from false [2021-12-15 13:56:46,453 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1112 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1112) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 6)) 0)) is different from false [2021-12-15 13:56:46,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 7)) 0)) is different from false [2021-12-15 13:56:46,473 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1111) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 7)) 0)) is different from false [2021-12-15 13:56:46,477 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 8)) 0)) is different from false [2021-12-15 13:56:46,481 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1110) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 8)) 0)) is different from false [2021-12-15 13:56:46,485 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 9)) 0)) is different from false [2021-12-15 13:56:46,488 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 9)) 0)) is different from false [2021-12-15 13:56:46,491 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:46,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-15 13:56:46,503 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:46,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2021-12-15 13:56:46,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:56:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 179 not checked. [2021-12-15 13:56:46,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264854593] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:46,767 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:46,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 36, 36] total 90 [2021-12-15 13:56:46,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725291582] [2021-12-15 13:56:46,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:46,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2021-12-15 13:56:46,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:46,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2021-12-15 13:56:46,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=4775, Unknown=19, NotChecked=2964, Total=8010 [2021-12-15 13:56:46,768 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 90 states, 90 states have (on average 2.188888888888889) internal successors, (197), 90 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:48,922 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2021-12-15 13:56:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-12-15 13:56:48,922 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 2.188888888888889) internal successors, (197), 90 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-12-15 13:56:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:48,923 INFO L225 Difference]: With dead ends: 136 [2021-12-15 13:56:48,923 INFO L226 Difference]: Without dead ends: 94 [2021-12-15 13:56:48,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 122 SyntacticMatches, 30 SemanticMatches, 108 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 2327 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=376, Invalid=7871, Unknown=19, NotChecked=3724, Total=11990 [2021-12-15 13:56:48,924 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 3555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1349 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:48,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 1030 Invalid, 3555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2167 Invalid, 0 Unknown, 1349 Unchecked, 0.7s Time] [2021-12-15 13:56:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-15 13:56:48,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2021-12-15 13:56:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2021-12-15 13:56:48,925 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2021-12-15 13:56:48,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:48,926 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2021-12-15 13:56:48,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 2.188888888888889) internal successors, (197), 90 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2021-12-15 13:56:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-15 13:56:48,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:48,927 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:48,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-15 13:56:49,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:49,140 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:49,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:49,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1215297487, now seen corresponding path program 16 times [2021-12-15 13:56:49,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:49,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126220359] [2021-12-15 13:56:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:49,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 120 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:49,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:49,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126220359] [2021-12-15 13:56:49,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126220359] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:49,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625570852] [2021-12-15 13:56:49,510 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 13:56:49,510 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:49,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:49,512 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:49,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-15 13:56:49,657 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 13:56:49,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:49,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 178 conjunts are in the unsatisfiable core [2021-12-15 13:56:49,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:49,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 13:56:49,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-15 13:56:50,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-15 13:56:50,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 13:56:50,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 13:56:50,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 13:56:50,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 13:56:50,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 13:56:50,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 13:56:51,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 13:56:51,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 13:56:51,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 13:56:51,316 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:51,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2021-12-15 13:56:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 162 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:51,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:56:52,869 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1227 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_228| Int)) (or (< |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_228| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1227) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_228| 9))) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_228| 11) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (< |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_228|))) is different from false [2021-12-15 13:56:52,882 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1227 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_228| Int)) (or (< |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_228| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1227) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_228| 9))) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_228| 11) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_228|))) is different from false [2021-12-15 13:56:52,889 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:52,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-15 13:56:52,894 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 13:56:52,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2021-12-15 13:56:52,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 13:56:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-15 13:56:54,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625570852] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:56:54,345 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:56:54,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 37, 37] total 98 [2021-12-15 13:56:54,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628894359] [2021-12-15 13:56:54,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:56:54,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2021-12-15 13:56:54,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:56:54,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2021-12-15 13:56:54,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=927, Invalid=8383, Unknown=10, NotChecked=382, Total=9702 [2021-12-15 13:56:54,346 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 99 states, 98 states have (on average 2.673469387755102) internal successors, (262), 99 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:57,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:56:57,591 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2021-12-15 13:56:57,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-12-15 13:56:57,592 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 98 states have (on average 2.673469387755102) internal successors, (262), 99 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-12-15 13:56:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:56:57,592 INFO L225 Difference]: With dead ends: 101 [2021-12-15 13:56:57,592 INFO L226 Difference]: Without dead ends: 101 [2021-12-15 13:56:57,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 108 SyntacticMatches, 12 SemanticMatches, 132 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3251 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2471, Invalid=14801, Unknown=28, NotChecked=522, Total=17822 [2021-12-15 13:56:57,593 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 247 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 2566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1055 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 13:56:57,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 641 Invalid, 2566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1296 Invalid, 0 Unknown, 1055 Unchecked, 0.5s Time] [2021-12-15 13:56:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-15 13:56:57,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2021-12-15 13:56:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2021-12-15 13:56:57,596 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 90 [2021-12-15 13:56:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:56:57,596 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2021-12-15 13:56:57,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 98 states have (on average 2.673469387755102) internal successors, (262), 99 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:56:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2021-12-15 13:56:57,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-15 13:56:57,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:56:57,597 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:56:57,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-15 13:56:57,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:57,807 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:56:57,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:56:57,807 INFO L85 PathProgramCache]: Analyzing trace with hash -893218717, now seen corresponding path program 17 times [2021-12-15 13:56:57,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:56:57,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111505119] [2021-12-15 13:56:57,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:56:57,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:56:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:56:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 256 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:58,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:56:58,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111505119] [2021-12-15 13:56:58,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111505119] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:56:58,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171857896] [2021-12-15 13:56:58,167 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 13:56:58,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:56:58,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:56:58,168 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:56:58,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-15 13:56:58,780 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2021-12-15 13:56:58,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 13:56:58,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 97 conjunts are in the unsatisfiable core [2021-12-15 13:56:58,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 13:56:58,809 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 13:56:58,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 13:56:59,741 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 277 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:56:59,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 13:57:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 277 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:00,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171857896] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 13:57:00,399 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 13:57:00,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 66 [2021-12-15 13:57:00,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333028415] [2021-12-15 13:57:00,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 13:57:00,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-12-15 13:57:00,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:57:00,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-12-15 13:57:00,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=688, Invalid=3602, Unknown=0, NotChecked=0, Total=4290 [2021-12-15 13:57:00,400 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 66 states, 66 states have (on average 3.5454545454545454) internal successors, (234), 66 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:57:01,359 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2021-12-15 13:57:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-15 13:57:01,359 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.5454545454545454) internal successors, (234), 66 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-12-15 13:57:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:57:01,360 INFO L225 Difference]: With dead ends: 154 [2021-12-15 13:57:01,360 INFO L226 Difference]: Without dead ends: 106 [2021-12-15 13:57:01,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2032 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1482, Invalid=6708, Unknown=0, NotChecked=0, Total=8190 [2021-12-15 13:57:01,361 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 173 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 13:57:01,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 237 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 13:57:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-15 13:57:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2021-12-15 13:57:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2021-12-15 13:57:01,362 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2021-12-15 13:57:01,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:57:01,362 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2021-12-15 13:57:01,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.5454545454545454) internal successors, (234), 66 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:57:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2021-12-15 13:57:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-15 13:57:01,363 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:57:01,363 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:57:01,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-15 13:57:01,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-12-15 13:57:01,583 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-12-15 13:57:01,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:57:01,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1268304960, now seen corresponding path program 18 times [2021-12-15 13:57:01,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:57:01,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706011714] [2021-12-15 13:57:01,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:57:01,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:57:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:57:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 24 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 13:57:03,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:57:03,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706011714] [2021-12-15 13:57:03,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706011714] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 13:57:03,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875333677] [2021-12-15 13:57:03,081 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 13:57:03,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 13:57:03,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:57:03,082 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 13:57:03,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process