./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e19ca921 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/cstrcpy-alloca-1.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 fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 16:25:07,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 16:25:07,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 16:25:07,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 16:25:07,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 16:25:07,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 16:25:07,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 16:25:07,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 16:25:07,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 16:25:07,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 16:25:07,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 16:25:07,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 16:25:07,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 16:25:07,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 16:25:07,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 16:25:07,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 16:25:07,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 16:25:07,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 16:25:07,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 16:25:07,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 16:25:07,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 16:25:07,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 16:25:07,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 16:25:07,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 16:25:07,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 16:25:07,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 16:25:07,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 16:25:07,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 16:25:07,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 16:25:07,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 16:25:07,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 16:25:07,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 16:25:07,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 16:25:07,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 16:25:07,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 16:25:07,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 16:25:07,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 16:25:07,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 16:25:07,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 16:25:07,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 16:25:07,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 16:25:07,902 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-22 16:25:07,927 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 16:25:07,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 16:25:07,928 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 16:25:07,928 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 16:25:07,929 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 16:25:07,929 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 16:25:07,930 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 16:25:07,930 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 16:25:07,930 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 16:25:07,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 16:25:07,931 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 16:25:07,931 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 16:25:07,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 16:25:07,932 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 16:25:07,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 16:25:07,932 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 16:25:07,932 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 16:25:07,932 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 16:25:07,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 16:25:07,933 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 16:25:07,933 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 16:25:07,933 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 16:25:07,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 16:25:07,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 16:25:07,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 16:25:07,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:25:07,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 16:25:07,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 16:25:07,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 16:25:07,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 16:25:07,935 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 16:25:07,935 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 -> fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 [2021-12-22 16:25:08,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 16:25:08,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 16:25:08,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 16:25:08,188 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 16:25:08,188 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 16:25:08,189 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2021-12-22 16:25:08,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71ebab3f/ae0ad9027ae145e29c804fa0f94c893a/FLAG7457cf0e2 [2021-12-22 16:25:08,627 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 16:25:08,627 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2021-12-22 16:25:08,640 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71ebab3f/ae0ad9027ae145e29c804fa0f94c893a/FLAG7457cf0e2 [2021-12-22 16:25:08,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71ebab3f/ae0ad9027ae145e29c804fa0f94c893a [2021-12-22 16:25:08,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 16:25:08,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 16:25:08,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 16:25:08,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 16:25:08,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 16:25:08,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:25:08" (1/1) ... [2021-12-22 16:25:08,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1da4dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:25:08, skipping insertion in model container [2021-12-22 16:25:08,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:25:08" (1/1) ... [2021-12-22 16:25:08,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 16:25:08,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:25:08,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:25:08,908 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 16:25:08,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:25:08,965 INFO L208 MainTranslator]: Completed translation [2021-12-22 16:25:08,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:25:08 WrapperNode [2021-12-22 16:25:08,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 16:25:08,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 16:25:08,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 16:25:08,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 16:25:08,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:25:08" (1/1) ... [2021-12-22 16:25:08,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:25:08" (1/1) ... [2021-12-22 16:25:09,015 INFO L137 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2021-12-22 16:25:09,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 16:25:09,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 16:25:09,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 16:25:09,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 16:25:09,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:25:08" (1/1) ... [2021-12-22 16:25:09,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:25:08" (1/1) ... [2021-12-22 16:25:09,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:25:08" (1/1) ... [2021-12-22 16:25:09,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:25:08" (1/1) ... [2021-12-22 16:25:09,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:25:08" (1/1) ... [2021-12-22 16:25:09,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:25:08" (1/1) ... [2021-12-22 16:25:09,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:25:08" (1/1) ... [2021-12-22 16:25:09,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 16:25:09,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 16:25:09,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 16:25:09,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 16:25:09,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:25:08" (1/1) ... [2021-12-22 16:25:09,063 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:25:09,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:25:09,081 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-22 16:25:09,083 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-22 16:25:09,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 16:25:09,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 16:25:09,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 16:25:09,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 16:25:09,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 16:25:09,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 16:25:09,188 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 16:25:09,190 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 16:25:09,367 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 16:25:09,371 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 16:25:09,372 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-22 16:25:09,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:25:09 BoogieIcfgContainer [2021-12-22 16:25:09,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 16:25:09,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 16:25:09,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 16:25:09,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 16:25:09,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:25:08" (1/3) ... [2021-12-22 16:25:09,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e761f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:25:09, skipping insertion in model container [2021-12-22 16:25:09,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:25:08" (2/3) ... [2021-12-22 16:25:09,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e761f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:25:09, skipping insertion in model container [2021-12-22 16:25:09,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:25:09" (3/3) ... [2021-12-22 16:25:09,381 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-1.i [2021-12-22 16:25:09,386 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 16:25:09,387 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2021-12-22 16:25:09,424 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 16:25:09,433 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-22 16:25:09,434 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-12-22 16:25:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 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-22 16:25:09,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-22 16:25:09,456 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:09,456 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-22 16:25:09,457 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:09,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:09,462 INFO L85 PathProgramCache]: Analyzing trace with hash 889510840, now seen corresponding path program 1 times [2021-12-22 16:25:09,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:09,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098345070] [2021-12-22 16:25:09,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:09,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:09,598 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-22 16:25:09,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:09,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098345070] [2021-12-22 16:25:09,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098345070] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:25:09,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:25:09,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:25:09,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823623249] [2021-12-22 16:25:09,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:25:09,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:25:09,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:09,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:25:09,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:25:09,628 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-22 16:25:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:09,678 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2021-12-22 16:25:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:25:09,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-12-22 16:25:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:09,687 INFO L225 Difference]: With dead ends: 34 [2021-12-22 16:25:09,687 INFO L226 Difference]: Without dead ends: 30 [2021-12-22 16:25:09,690 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-22 16:25:09,692 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:09,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 35 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:25:09,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-22 16:25:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2021-12-22 16:25:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 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-22 16:25:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-22 16:25:09,714 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2021-12-22 16:25:09,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:09,715 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-22 16:25:09,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-22 16:25:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-22 16:25:09,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-22 16:25:09,716 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:09,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-22 16:25:09,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 16:25:09,717 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:09,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:09,718 INFO L85 PathProgramCache]: Analyzing trace with hash 889512762, now seen corresponding path program 1 times [2021-12-22 16:25:09,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:09,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548439705] [2021-12-22 16:25:09,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:09,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:09,760 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-22 16:25:09,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:09,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548439705] [2021-12-22 16:25:09,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548439705] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:25:09,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:25:09,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:25:09,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682874136] [2021-12-22 16:25:09,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:25:09,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:25:09,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:09,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:25:09,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:25:09,765 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-22 16:25:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:09,784 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2021-12-22 16:25:09,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:25:09,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-12-22 16:25:09,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:09,787 INFO L225 Difference]: With dead ends: 29 [2021-12-22 16:25:09,787 INFO L226 Difference]: Without dead ends: 28 [2021-12-22 16:25:09,788 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-22 16:25:09,791 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:09,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:25:09,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-22 16:25:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-22 16:25:09,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:25:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2021-12-22 16:25:09,797 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2021-12-22 16:25:09,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:09,798 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2021-12-22 16:25:09,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-22 16:25:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2021-12-22 16:25:09,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-22 16:25:09,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:09,800 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:09,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 16:25:09,801 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:09,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:09,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033015, now seen corresponding path program 1 times [2021-12-22 16:25:09,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:09,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190517484] [2021-12-22 16:25:09,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:09,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:09,841 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-22 16:25:09,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:09,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190517484] [2021-12-22 16:25:09,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190517484] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:25:09,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:25:09,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:25:09,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344797502] [2021-12-22 16:25:09,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:25:09,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:25:09,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:09,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:25:09,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:25:09,844 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. 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-22 16:25:09,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:09,865 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2021-12-22 16:25:09,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:25:09,865 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-22 16:25:09,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:09,866 INFO L225 Difference]: With dead ends: 25 [2021-12-22 16:25:09,866 INFO L226 Difference]: Without dead ends: 25 [2021-12-22 16:25:09,867 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-22 16:25:09,872 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:09,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:25:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-22 16:25:09,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-22 16:25:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:25:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-12-22 16:25:09,879 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2021-12-22 16:25:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:09,879 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-12-22 16:25:09,879 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-22 16:25:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-12-22 16:25:09,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-22 16:25:09,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:09,880 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:09,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 16:25:09,881 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:09,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:09,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033016, now seen corresponding path program 1 times [2021-12-22 16:25:09,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:09,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523427576] [2021-12-22 16:25:09,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:09,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:25:09,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:09,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523427576] [2021-12-22 16:25:09,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523427576] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:25:09,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:25:09,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:25:09,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629338174] [2021-12-22 16:25:09,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:25:09,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:25:09,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:09,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:25:09,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:25:09,953 INFO L87 Difference]: Start difference. First operand 25 states and 28 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-22 16:25:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:10,011 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-12-22 16:25:10,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:25:10,012 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-22 16:25:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:10,012 INFO L225 Difference]: With dead ends: 24 [2021-12-22 16:25:10,012 INFO L226 Difference]: Without dead ends: 24 [2021-12-22 16:25:10,013 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-22 16:25:10,013 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:10,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:25:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-22 16:25:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-12-22 16:25:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:25:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-12-22 16:25:10,016 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2021-12-22 16:25:10,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:10,016 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-22 16:25:10,017 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-22 16:25:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-12-22 16:25:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-22 16:25:10,017 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:10,017 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:10,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 16:25:10,018 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:10,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:10,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033069, now seen corresponding path program 1 times [2021-12-22 16:25:10,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:10,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839158598] [2021-12-22 16:25:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:10,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:10,073 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-22 16:25:10,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:10,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839158598] [2021-12-22 16:25:10,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839158598] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:25:10,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:25:10,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:25:10,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186884507] [2021-12-22 16:25:10,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:25:10,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:25:10,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:10,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:25:10,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:25:10,078 INFO L87 Difference]: Start difference. First operand 24 states and 27 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-22 16:25:10,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:10,100 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2021-12-22 16:25:10,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:25:10,101 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-22 16:25:10,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:10,103 INFO L225 Difference]: With dead ends: 40 [2021-12-22 16:25:10,104 INFO L226 Difference]: Without dead ends: 40 [2021-12-22 16:25:10,104 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-22 16:25:10,105 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 44 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-22 16:25:10,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:25:10,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-22 16:25:10,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2021-12-22 16:25:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:25:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2021-12-22 16:25:10,113 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 7 [2021-12-22 16:25:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:10,113 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2021-12-22 16:25:10,113 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-22 16:25:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2021-12-22 16:25:10,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-22 16:25:10,116 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:10,116 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:10,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 16:25:10,117 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:10,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1805092651, now seen corresponding path program 1 times [2021-12-22 16:25:10,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:10,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171768706] [2021-12-22 16:25:10,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:10,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:10,148 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-22 16:25:10,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:10,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171768706] [2021-12-22 16:25:10,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171768706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:25:10,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:25:10,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:25:10,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222942900] [2021-12-22 16:25:10,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:25:10,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:25:10,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:10,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:25:10,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:25:10,150 INFO L87 Difference]: Start difference. First operand 26 states and 29 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-22 16:25:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:10,192 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-12-22 16:25:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:25:10,193 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-22 16:25:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:10,193 INFO L225 Difference]: With dead ends: 44 [2021-12-22 16:25:10,193 INFO L226 Difference]: Without dead ends: 44 [2021-12-22 16:25:10,194 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-22 16:25:10,194 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:10,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 33 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:25:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-22 16:25:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2021-12-22 16:25:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 27 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-22 16:25:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-22 16:25:10,197 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 7 [2021-12-22 16:25:10,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:10,197 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-22 16:25:10,197 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-22 16:25:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-22 16:25:10,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 16:25:10,198 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:10,198 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:10,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 16:25:10,198 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:10,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:10,198 INFO L85 PathProgramCache]: Analyzing trace with hash 748014037, now seen corresponding path program 1 times [2021-12-22 16:25:10,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:10,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854539654] [2021-12-22 16:25:10,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:10,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:10,284 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-22 16:25:10,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:10,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854539654] [2021-12-22 16:25:10,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854539654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:25:10,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:25:10,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:25:10,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006001143] [2021-12-22 16:25:10,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:25:10,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:25:10,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:10,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:25:10,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:25:10,288 INFO L87 Difference]: Start difference. First operand 28 states and 32 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-22 16:25:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:10,360 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2021-12-22 16:25:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:25:10,360 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-22 16:25:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:10,361 INFO L225 Difference]: With dead ends: 35 [2021-12-22 16:25:10,361 INFO L226 Difference]: Without dead ends: 35 [2021-12-22 16:25:10,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:25:10,362 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 85 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:10,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 48 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:25:10,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-22 16:25:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2021-12-22 16:25:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.4583333333333333) 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-22 16:25:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-12-22 16:25:10,364 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2021-12-22 16:25:10,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:10,364 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-22 16:25:10,364 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-22 16:25:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-12-22 16:25:10,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 16:25:10,365 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:10,365 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:10,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 16:25:10,365 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:10,365 INFO L85 PathProgramCache]: Analyzing trace with hash 748014036, now seen corresponding path program 1 times [2021-12-22 16:25:10,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:10,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719958822] [2021-12-22 16:25:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:10,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:10,396 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-22 16:25:10,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:10,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719958822] [2021-12-22 16:25:10,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719958822] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:25:10,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:25:10,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:25:10,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105198946] [2021-12-22 16:25:10,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:25:10,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:25:10,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:10,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:25:10,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:25:10,398 INFO L87 Difference]: Start difference. First operand 30 states and 35 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-22 16:25:10,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:10,427 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2021-12-22 16:25:10,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:25:10,427 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-22 16:25:10,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:10,428 INFO L225 Difference]: With dead ends: 29 [2021-12-22 16:25:10,428 INFO L226 Difference]: Without dead ends: 29 [2021-12-22 16:25:10,428 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-22 16:25:10,429 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:10,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:25:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-22 16:25:10,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-22 16:25:10,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-22 16:25:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-12-22 16:25:10,431 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 10 [2021-12-22 16:25:10,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:10,431 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-12-22 16:25:10,431 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-22 16:25:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-12-22 16:25:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:25:10,432 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:10,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:10,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 16:25:10,432 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:10,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1713598655, now seen corresponding path program 1 times [2021-12-22 16:25:10,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:10,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264348194] [2021-12-22 16:25:10,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:10,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:10,492 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-22 16:25:10,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:10,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264348194] [2021-12-22 16:25:10,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264348194] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:25:10,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:25:10,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:25:10,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782699076] [2021-12-22 16:25:10,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:25:10,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:25:10,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:10,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:25:10,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:25:10,495 INFO L87 Difference]: Start difference. First operand 29 states and 33 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-22 16:25:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:10,528 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-12-22 16:25:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:25:10,529 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-22 16:25:10,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:10,530 INFO L225 Difference]: With dead ends: 28 [2021-12-22 16:25:10,530 INFO L226 Difference]: Without dead ends: 28 [2021-12-22 16:25:10,530 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-22 16:25:10,533 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:10,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:25:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-22 16:25:10,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-22 16:25:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 27 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-22 16:25:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-22 16:25:10,535 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 11 [2021-12-22 16:25:10,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:10,536 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-22 16:25:10,536 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-22 16:25:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-22 16:25:10,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:25:10,545 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:10,545 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:10,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 16:25:10,545 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:10,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:10,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1713598656, now seen corresponding path program 1 times [2021-12-22 16:25:10,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:10,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040932817] [2021-12-22 16:25:10,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:10,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:10,616 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-22 16:25:10,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:10,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040932817] [2021-12-22 16:25:10,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040932817] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:25:10,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:25:10,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:25:10,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302244403] [2021-12-22 16:25:10,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:25:10,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:25:10,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:10,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:25:10,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:25:10,619 INFO L87 Difference]: Start difference. First operand 28 states and 32 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-22 16:25:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:10,679 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2021-12-22 16:25:10,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:25:10,680 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-22 16:25:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:10,680 INFO L225 Difference]: With dead ends: 30 [2021-12-22 16:25:10,680 INFO L226 Difference]: Without dead ends: 30 [2021-12-22 16:25:10,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:25:10,681 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:10,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:25:10,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-22 16:25:10,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2021-12-22 16:25:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-22 16:25:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-12-22 16:25:10,690 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2021-12-22 16:25:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:10,691 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-12-22 16:25:10,691 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-22 16:25:10,691 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-12-22 16:25:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:25:10,692 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:10,692 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:10,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 16:25:10,692 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:10,692 INFO L85 PathProgramCache]: Analyzing trace with hash 952918382, now seen corresponding path program 1 times [2021-12-22 16:25:10,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:10,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955011932] [2021-12-22 16:25:10,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:10,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 16:25:10,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:10,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955011932] [2021-12-22 16:25:10,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955011932] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:25:10,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:25:10,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:25:10,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548037494] [2021-12-22 16:25:10,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:25:10,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:25:10,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:10,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:25:10,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:25:10,731 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 16:25:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:10,751 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2021-12-22 16:25:10,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:25:10,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 16:25:10,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:10,753 INFO L225 Difference]: With dead ends: 49 [2021-12-22 16:25:10,753 INFO L226 Difference]: Without dead ends: 49 [2021-12-22 16:25:10,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:25:10,754 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:10,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:25:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-22 16:25:10,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2021-12-22 16:25:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3461538461538463) 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-22 16:25:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-12-22 16:25:10,759 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 11 [2021-12-22 16:25:10,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:10,759 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-22 16:25:10,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 16:25:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-12-22 16:25:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:25:10,760 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:10,760 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:10,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 16:25:10,761 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:10,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:10,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1632976752, now seen corresponding path program 1 times [2021-12-22 16:25:10,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:10,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776198170] [2021-12-22 16:25:10,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:10,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:10,808 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-22 16:25:10,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:10,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776198170] [2021-12-22 16:25:10,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776198170] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:25:10,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981435262] [2021-12-22 16:25:10,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:10,809 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:25:10,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:25:10,815 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-22 16:25:10,817 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-22 16:25:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:10,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 16:25:10,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:25:10,955 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 16:25:10,956 INFO L387 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-22 16:25:11,018 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-22 16:25:11,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:25:11,232 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-22 16:25:11,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981435262] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:25:11,233 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:25:11,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-12-22 16:25:11,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254633546] [2021-12-22 16:25:11,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:25:11,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:25:11,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:11,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:25:11,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:25:11,234 INFO L87 Difference]: Start difference. First operand 30 states and 35 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-22 16:25:11,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:11,327 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2021-12-22 16:25:11,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:25:11,328 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-22 16:25:11,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:11,328 INFO L225 Difference]: With dead ends: 62 [2021-12-22 16:25:11,328 INFO L226 Difference]: Without dead ends: 62 [2021-12-22 16:25:11,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:25:11,329 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 84 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:11,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 91 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:25:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-22 16:25:11,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 27. [2021-12-22 16:25:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:25:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-22 16:25:11,331 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 11 [2021-12-22 16:25:11,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:11,331 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-22 16:25:11,331 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-22 16:25:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-22 16:25:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-22 16:25:11,332 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:11,332 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:11,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 16:25:11,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-22 16:25:11,548 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash -163723683, now seen corresponding path program 1 times [2021-12-22 16:25:11,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:11,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600956885] [2021-12-22 16:25:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:11,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:11,647 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-22 16:25:11,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:11,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600956885] [2021-12-22 16:25:11,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600956885] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:25:11,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:25:11,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:25:11,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766315197] [2021-12-22 16:25:11,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:25:11,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 16:25:11,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:11,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 16:25:11,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:25:11,649 INFO L87 Difference]: Start difference. First operand 27 states and 31 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-22 16:25:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:11,710 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2021-12-22 16:25:11,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:25:11,711 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-22 16:25:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:11,712 INFO L225 Difference]: With dead ends: 39 [2021-12-22 16:25:11,712 INFO L226 Difference]: Without dead ends: 39 [2021-12-22 16:25:11,712 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-22 16:25:11,713 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:11,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 92 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:25:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-22 16:25:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2021-12-22 16:25:11,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.21875) internal successors, (39), 34 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-22 16:25:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2021-12-22 16:25:11,719 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2021-12-22 16:25:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:11,719 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-12-22 16:25:11,719 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-22 16:25:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2021-12-22 16:25:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-22 16:25:11,723 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:11,723 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:11,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 16:25:11,723 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:11,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash 537340895, now seen corresponding path program 1 times [2021-12-22 16:25:11,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:11,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549404668] [2021-12-22 16:25:11,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:11,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:11,805 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-22 16:25:11,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:11,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549404668] [2021-12-22 16:25:11,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549404668] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:25:11,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:25:11,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:25:11,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746266447] [2021-12-22 16:25:11,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:25:11,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 16:25:11,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:11,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 16:25:11,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:25:11,807 INFO L87 Difference]: Start difference. First operand 35 states and 39 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-22 16:25:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:11,899 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2021-12-22 16:25:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:25:11,900 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-22 16:25:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:11,900 INFO L225 Difference]: With dead ends: 53 [2021-12-22 16:25:11,900 INFO L226 Difference]: Without dead ends: 53 [2021-12-22 16:25:11,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-22 16:25:11,901 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:11,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 110 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:25:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-22 16:25:11,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2021-12-22 16:25:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:25:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-12-22 16:25:11,902 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2021-12-22 16:25:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:11,903 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-12-22 16:25:11,903 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-22 16:25:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2021-12-22 16:25:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-22 16:25:11,903 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:11,903 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:11,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 16:25:11,904 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:11,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:11,904 INFO L85 PathProgramCache]: Analyzing trace with hash 795506333, now seen corresponding path program 1 times [2021-12-22 16:25:11,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:11,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270665047] [2021-12-22 16:25:11,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:11,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:11,991 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-22 16:25:11,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:11,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270665047] [2021-12-22 16:25:11,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270665047] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:25:11,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:25:11,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:25:11,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045354120] [2021-12-22 16:25:11,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:25:11,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 16:25:11,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:11,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 16:25:11,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:25:11,993 INFO L87 Difference]: Start difference. First operand 33 states and 37 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-22 16:25:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:12,168 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2021-12-22 16:25:12,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:25:12,168 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-22 16:25:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:12,168 INFO L225 Difference]: With dead ends: 47 [2021-12-22 16:25:12,168 INFO L226 Difference]: Without dead ends: 47 [2021-12-22 16:25:12,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-22 16:25:12,169 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:12,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 95 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:25:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-22 16:25:12,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2021-12-22 16:25:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 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-22 16:25:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-12-22 16:25:12,171 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2021-12-22 16:25:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:12,171 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-12-22 16:25:12,171 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-22 16:25:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-12-22 16:25:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 16:25:12,172 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:12,172 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:12,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 16:25:12,172 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:12,172 INFO L85 PathProgramCache]: Analyzing trace with hash -780511546, now seen corresponding path program 1 times [2021-12-22 16:25:12,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:12,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061970361] [2021-12-22 16:25:12,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:12,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:12,213 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-22 16:25:12,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:12,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061970361] [2021-12-22 16:25:12,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061970361] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:25:12,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:25:12,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:25:12,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956811623] [2021-12-22 16:25:12,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:25:12,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:25:12,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:12,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:25:12,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:25:12,215 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-22 16:25:12,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:12,223 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2021-12-22 16:25:12,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:25:12,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-22 16:25:12,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:12,224 INFO L225 Difference]: With dead ends: 33 [2021-12-22 16:25:12,224 INFO L226 Difference]: Without dead ends: 21 [2021-12-22 16:25:12,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:25:12,225 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:12,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:25:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-22 16:25:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-22 16:25:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:25:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-12-22 16:25:12,227 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2021-12-22 16:25:12,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:12,227 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-12-22 16:25:12,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-22 16:25:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-12-22 16:25:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-22 16:25:12,228 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:12,228 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:12,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 16:25:12,228 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:12,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2086958086, now seen corresponding path program 1 times [2021-12-22 16:25:12,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:12,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73500666] [2021-12-22 16:25:12,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:12,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:12,346 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-22 16:25:12,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:12,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73500666] [2021-12-22 16:25:12,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73500666] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:25:12,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471216382] [2021-12-22 16:25:12,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:12,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:25:12,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:25:12,348 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-22 16:25:12,349 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-22 16:25:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:12,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-22 16:25:12,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:25:12,547 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-22 16:25:12,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:25:12,675 INFO L387 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-22 16:25:12,699 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-22 16:25:12,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471216382] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:25:12,700 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:25:12,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2021-12-22 16:25:12,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258814927] [2021-12-22 16:25:12,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:25:12,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-22 16:25:12,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:12,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-22 16:25:12,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-12-22 16:25:12,702 INFO L87 Difference]: Start difference. First operand 21 states and 22 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-22 16:25:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:12,856 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-12-22 16:25:12,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:25:12,857 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-22 16:25:12,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:12,857 INFO L225 Difference]: With dead ends: 30 [2021-12-22 16:25:12,857 INFO L226 Difference]: Without dead ends: 30 [2021-12-22 16:25:12,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2021-12-22 16:25:12,858 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 88 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:12,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 70 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:25:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-22 16:25:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2021-12-22 16:25:12,859 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-22 16:25:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-12-22 16:25:12,859 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2021-12-22 16:25:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:12,860 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-12-22 16:25:12,860 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-22 16:25:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2021-12-22 16:25:12,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 16:25:12,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:12,861 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:12,879 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-22 16:25:13,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-22 16:25:13,069 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:13,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash -271191237, now seen corresponding path program 1 times [2021-12-22 16:25:13,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:13,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311158348] [2021-12-22 16:25:13,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:13,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:25:13,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:13,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311158348] [2021-12-22 16:25:13,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311158348] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:25:13,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117542877] [2021-12-22 16:25:13,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:13,168 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:25:13,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:25:13,169 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-22 16:25:13,170 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-22 16:25:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:13,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-22 16:25:13,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:25:13,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:25:13,255 INFO L387 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-22 16:25:13,262 INFO L387 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-22 16:25:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:25:13,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:25:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:25:13,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117542877] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:25:13,567 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:25:13,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2021-12-22 16:25:13,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015026011] [2021-12-22 16:25:13,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:25:13,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-22 16:25:13,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-22 16:25:13,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2021-12-22 16:25:13,569 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 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-22 16:25:13,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:13,795 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2021-12-22 16:25:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:25:13,796 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 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-22 16:25:13,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:13,796 INFO L225 Difference]: With dead ends: 29 [2021-12-22 16:25:13,796 INFO L226 Difference]: Without dead ends: 29 [2021-12-22 16:25:13,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2021-12-22 16:25:13,797 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 58 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:13,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 73 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:25:13,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-22 16:25:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2021-12-22 16:25:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:25:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-12-22 16:25:13,798 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2021-12-22 16:25:13,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:13,798 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-12-22 16:25:13,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 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-22 16:25:13,798 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-12-22 16:25:13,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-22 16:25:13,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:13,799 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:13,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 16:25:13,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-22 16:25:13,999 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:14,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:14,000 INFO L85 PathProgramCache]: Analyzing trace with hash -224662014, now seen corresponding path program 2 times [2021-12-22 16:25:14,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:14,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352797182] [2021-12-22 16:25:14,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:14,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:14,201 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-22 16:25:14,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:14,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352797182] [2021-12-22 16:25:14,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352797182] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:25:14,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773697322] [2021-12-22 16:25:14,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 16:25:14,202 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:25:14,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:25:14,212 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-22 16:25:14,213 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-22 16:25:14,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 16:25:14,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:25:14,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-22 16:25:14,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:25:14,281 INFO L387 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-22 16:25:14,344 INFO L387 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-22 16:25:14,544 INFO L387 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-22 16:25:14,679 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:25:14,679 INFO L387 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-22 16:25:14,789 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-22 16:25:14,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:25:15,051 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| Int) (v_ArrVal_188 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 1)) 0) (<= (+ 3 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2021-12-22 16:25:15,066 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| Int) (v_ArrVal_188 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|)) (<= (+ 3 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 1)) 0))) is different from false [2021-12-22 16:25:15,079 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:25:15,079 INFO L387 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-22 16:25:15,086 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:25:15,086 INFO L387 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-22 16:25:15,090 INFO L387 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-22 16:25:15,093 INFO L387 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 16 treesize of output 12 [2021-12-22 16:25:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-22 16:25:15,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773697322] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:25:15,202 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:25:15,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2021-12-22 16:25:15,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354012331] [2021-12-22 16:25:15,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:25:15,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-22 16:25:15,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:15,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-22 16:25:15,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=950, Unknown=3, NotChecked=126, Total=1190 [2021-12-22 16:25:15,203 INFO L87 Difference]: Start difference. First operand 25 states and 26 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-22 16:25:15,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:15,672 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2021-12-22 16:25:15,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-22 16:25:15,673 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-22 16:25:15,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:15,673 INFO L225 Difference]: With dead ends: 48 [2021-12-22 16:25:15,673 INFO L226 Difference]: Without dead ends: 38 [2021-12-22 16:25:15,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=238, Invalid=1929, Unknown=3, NotChecked=182, Total=2352 [2021-12-22 16:25:15,674 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:15,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 141 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 212 Invalid, 0 Unknown, 139 Unchecked, 0.1s Time] [2021-12-22 16:25:15,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-22 16:25:15,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2021-12-22 16:25:15,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-22 16:25:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2021-12-22 16:25:15,676 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 22 [2021-12-22 16:25:15,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:15,676 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-12-22 16:25:15,676 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-22 16:25:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2021-12-22 16:25:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 16:25:15,676 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:15,676 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:15,695 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-22 16:25:15,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:25:15,877 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:15,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:15,877 INFO L85 PathProgramCache]: Analyzing trace with hash -121211530, now seen corresponding path program 2 times [2021-12-22 16:25:15,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:15,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672200920] [2021-12-22 16:25:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:15,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:25:16,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:16,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672200920] [2021-12-22 16:25:16,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672200920] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:25:16,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811838994] [2021-12-22 16:25:16,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 16:25:16,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:25:16,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:25:16,011 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-22 16:25:16,012 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-22 16:25:16,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 16:25:16,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:25:16,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-22 16:25:16,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:25:16,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:25:16,094 INFO L387 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-22 16:25:16,097 INFO L387 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-22 16:25:16,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:25:16,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:25:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:25:16,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811838994] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:25:16,552 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:25:16,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2021-12-22 16:25:16,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903858185] [2021-12-22 16:25:16,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:25:16,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-22 16:25:16,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:16,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-22 16:25:16,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2021-12-22 16:25:16,553 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:25:16,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:16,908 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2021-12-22 16:25:16,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 16:25:16,908 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-22 16:25:16,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:16,909 INFO L225 Difference]: With dead ends: 34 [2021-12-22 16:25:16,909 INFO L226 Difference]: Without dead ends: 34 [2021-12-22 16:25:16,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=1025, Unknown=0, NotChecked=0, Total=1260 [2021-12-22 16:25:16,910 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 84 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:16,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 100 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:25:16,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-22 16:25:16,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-22 16:25:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:25:16,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-12-22 16:25:16,923 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2021-12-22 16:25:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:16,924 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-12-22 16:25:16,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:25:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-12-22 16:25:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 16:25:16,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:16,928 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:16,945 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-22 16:25:17,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:25:17,134 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:17,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:17,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1054801383, now seen corresponding path program 3 times [2021-12-22 16:25:17,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:17,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151186715] [2021-12-22 16:25:17,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:17,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:17,378 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-22 16:25:17,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:17,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151186715] [2021-12-22 16:25:17,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151186715] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:25:17,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959610464] [2021-12-22 16:25:17,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 16:25:17,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:25:17,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:25:17,380 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-22 16:25:17,382 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-22 16:25:17,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-22 16:25:17,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:25:17,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 94 conjunts are in the unsatisfiable core [2021-12-22 16:25:17,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:25:17,485 INFO L387 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-22 16:25:17,699 INFO L387 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-22 16:25:17,828 INFO L387 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-22 16:25:17,925 INFO L387 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-22 16:25:18,002 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:25:18,004 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:25:18,004 INFO L387 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-22 16:25:18,009 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-22 16:25:18,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:25:18,024 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) is different from false [2021-12-22 16:25:18,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:25:18,041 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_260) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:25:18,052 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:25:18,073 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2021-12-22 16:25:18,078 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:25:18,078 INFO L387 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-22 16:25:18,083 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:25:18,083 INFO L387 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-22 16:25:18,086 INFO L387 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-22 16:25:18,248 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-22 16:25:18,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959610464] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:25:18,249 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:25:18,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 39 [2021-12-22 16:25:18,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051529564] [2021-12-22 16:25:18,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:25:18,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-22 16:25:18,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:18,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-22 16:25:18,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1015, Unknown=5, NotChecked=340, Total=1482 [2021-12-22 16:25:18,252 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:25:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:18,546 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2021-12-22 16:25:18,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 16:25:18,546 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-22 16:25:18,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:18,546 INFO L225 Difference]: With dead ends: 54 [2021-12-22 16:25:18,546 INFO L226 Difference]: Without dead ends: 40 [2021-12-22 16:25:18,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=1553, Unknown=5, NotChecked=420, Total=2162 [2021-12-22 16:25:18,548 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:18,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 191 Invalid, 0 Unknown, 127 Unchecked, 0.1s Time] [2021-12-22 16:25:18,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-22 16:25:18,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2021-12-22 16:25:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:25:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-12-22 16:25:18,549 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2021-12-22 16:25:18,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:18,549 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-12-22 16:25:18,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:25:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-12-22 16:25:18,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-22 16:25:18,550 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:18,550 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:18,567 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-22 16:25:18,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:25:18,763 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:18,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1308342596, now seen corresponding path program 4 times [2021-12-22 16:25:18,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:18,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071141254] [2021-12-22 16:25:18,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:18,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:18,887 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-22 16:25:18,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:18,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071141254] [2021-12-22 16:25:18,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071141254] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:25:18,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26749776] [2021-12-22 16:25:18,888 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-22 16:25:18,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:25:18,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:25:18,889 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-22 16:25:18,890 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-22 16:25:18,957 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-22 16:25:18,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:25:18,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 78 conjunts are in the unsatisfiable core [2021-12-22 16:25:18,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:25:18,977 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 16:25:18,977 INFO L387 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-22 16:25:18,984 INFO L387 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-22 16:25:19,154 INFO L387 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-22 16:25:19,319 INFO L387 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-22 16:25:19,429 INFO L387 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-22 16:25:19,545 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:25:19,547 INFO L387 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-22 16:25:19,666 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-22 16:25:19,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:25:20,034 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_307 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 4) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) 0))) is different from false [2021-12-22 16:25:20,051 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_307 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 4) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|))) is different from false [2021-12-22 16:25:20,065 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:25:20,065 INFO L387 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-22 16:25:20,071 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:25:20,072 INFO L387 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-22 16:25:20,075 INFO L387 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-22 16:25:20,660 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-22 16:25:20,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26749776] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:25:20,661 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:25:20,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 42 [2021-12-22 16:25:20,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724215396] [2021-12-22 16:25:20,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:25:20,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-22 16:25:20,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:20,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-22 16:25:20,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1456, Unknown=3, NotChecked=158, Total=1806 [2021-12-22 16:25:20,663 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 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-22 16:25:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:21,227 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2021-12-22 16:25:21,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 16:25:21,228 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 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-22 16:25:21,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:21,229 INFO L225 Difference]: With dead ends: 43 [2021-12-22 16:25:21,229 INFO L226 Difference]: Without dead ends: 43 [2021-12-22 16:25:21,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=380, Invalid=2595, Unknown=3, NotChecked=214, Total=3192 [2021-12-22 16:25:21,231 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:21,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 211 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 250 Invalid, 0 Unknown, 155 Unchecked, 0.1s Time] [2021-12-22 16:25:21,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-22 16:25:21,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2021-12-22 16:25:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-22 16:25:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2021-12-22 16:25:21,232 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 34 [2021-12-22 16:25:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:21,232 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2021-12-22 16:25:21,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 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-22 16:25:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2021-12-22 16:25:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 16:25:21,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:21,233 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:21,252 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-22 16:25:21,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:25:21,445 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:21,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:21,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1903914801, now seen corresponding path program 3 times [2021-12-22 16:25:21,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:21,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723741944] [2021-12-22 16:25:21,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:21,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:25:21,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:21,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723741944] [2021-12-22 16:25:21,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723741944] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:25:21,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840557373] [2021-12-22 16:25:21,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 16:25:21,590 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:25:21,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:25:21,591 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-22 16:25:21,592 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-22 16:25:21,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-22 16:25:21,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:25:21,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 78 conjunts are in the unsatisfiable core [2021-12-22 16:25:21,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:25:21,697 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 16:25:21,697 INFO L387 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-22 16:25:21,705 INFO L387 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-22 16:25:22,045 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-22 16:25:22,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:25:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-22 16:25:22,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840557373] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:25:22,476 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:25:22,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2021-12-22 16:25:22,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067467529] [2021-12-22 16:25:22,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:25:22,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-22 16:25:22,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:25:22,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-22 16:25:22,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2021-12-22 16:25:22,478 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-22 16:25:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:25:23,459 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2021-12-22 16:25:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-22 16:25:23,460 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-22 16:25:23,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:25:23,460 INFO L225 Difference]: With dead ends: 56 [2021-12-22 16:25:23,460 INFO L226 Difference]: Without dead ends: 56 [2021-12-22 16:25:23,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=437, Invalid=2113, Unknown=0, NotChecked=0, Total=2550 [2021-12-22 16:25:23,461 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 90 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:25:23,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 125 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 367 Invalid, 0 Unknown, 11 Unchecked, 0.2s Time] [2021-12-22 16:25:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-12-22 16:25:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2021-12-22 16:25:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:25:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2021-12-22 16:25:23,463 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 35 [2021-12-22 16:25:23,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:25:23,464 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2021-12-22 16:25:23,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-22 16:25:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2021-12-22 16:25:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-22 16:25:23,472 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:25:23,472 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:25:23,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-22 16:25:23,689 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,SelfDestructingSolverStorable22 [2021-12-22 16:25:23,689 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:25:23,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:25:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash 187721292, now seen corresponding path program 5 times [2021-12-22 16:25:23,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:25:23,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572500739] [2021-12-22 16:25:23,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:25:23,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:25:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:25:23,993 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-22 16:25:23,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:25:23,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572500739] [2021-12-22 16:25:23,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572500739] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:25:23,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897337591] [2021-12-22 16:25:23,993 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-22 16:25:23,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:25:23,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:25:23,994 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-22 16:25:23,995 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-22 16:25:24,076 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-22 16:25:24,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:25:24,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 84 conjunts are in the unsatisfiable core [2021-12-22 16:25:24,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:25:24,285 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-12-22 16:25:24,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:25:24,428 INFO L387 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 22 treesize of output 21 [2021-12-22 16:25:24,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:25:24,547 INFO L387 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 22 treesize of output 21 [2021-12-22 16:25:24,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:25:24,652 INFO L387 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 22 treesize of output 21 [2021-12-22 16:25:24,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:25:24,753 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:25:24,753 INFO L387 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 18 treesize of output 10 [2021-12-22 16:25:24,759 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-22 16:25:24,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:25:55,954 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (v_ArrVal_394 Int)) (or (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base|) |c_ULTIMATE.start_cstrcpy_#t~post2#1.offset| v_ArrVal_394)))) (store .cse0 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398))) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset|)))) is different from false [2021-12-22 16:25:58,046 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_54| Int)) (or (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset|)) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_54| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_54|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) is different from false [2021-12-22 16:26:00,106 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_54| Int)) (or (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (< |c_ULTIMATE.start_main_~nondetArea~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_54| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_54|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) is different from false [2021-12-22 16:26:00,116 INFO L387 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 778 treesize of output 766 [2021-12-22 16:26:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-22 16:26:00,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897337591] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:26:00,926 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:26:00,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 49 [2021-12-22 16:26:00,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394214067] [2021-12-22 16:26:00,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:26:00,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-22 16:26:00,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:26:00,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-22 16:26:00,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1915, Unknown=23, NotChecked=270, Total=2352 [2021-12-22 16:26:00,927 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-22 16:26:03,279 WARN L838 $PredicateComparison]: unable to prove that (and (< 3 |c_ULTIMATE.start_main_~length2~0#1|) (<= |c_ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 4 |c_ULTIMATE.start_main_~length2~0#1|) (<= |c_ULTIMATE.start_main_~length2~0#1| 4) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= |ULTIMATE.start_main_~length2~0#1| 4) (< 3 |ULTIMATE.start_main_~length2~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0))) (<= 0 |c_ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |c_ULTIMATE.start_main_~i~0#1| 3) (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_54| Int)) (or (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (< |c_ULTIMATE.start_main_~nondetArea~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_54| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_54|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:05,303 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= |ULTIMATE.start_main_~length2~0#1| 4) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (< 3 |ULTIMATE.start_main_~length2~0#1|))) (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) 3) 0) (<= |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset| 0) (not (= |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_54| Int)) (or (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset|)) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_54| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_54|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|)))) is different from false [2021-12-22 16:26:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:26:05,619 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2021-12-22 16:26:05,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-22 16:26:05,619 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 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-22 16:26:05,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:26:05,620 INFO L225 Difference]: With dead ends: 78 [2021-12-22 16:26:05,620 INFO L226 Difference]: Without dead ends: 60 [2021-12-22 16:26:05,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 40.4s TimeCoverageRelationStatistics Valid=251, Invalid=3284, Unknown=25, NotChecked=600, Total=4160 [2021-12-22 16:26:05,623 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:26:05,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 353 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 399 Invalid, 0 Unknown, 279 Unchecked, 0.2s Time] [2021-12-22 16:26:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-22 16:26:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2021-12-22 16:26:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-22 16:26:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-12-22 16:26:05,634 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 38 [2021-12-22 16:26:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:26:05,636 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-12-22 16:26:05,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-22 16:26:05,637 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-12-22 16:26:05,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-22 16:26:05,637 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:26:05,637 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:26:05,657 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-22 16:26:05,838 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,SelfDestructingSolverStorable23 [2021-12-22 16:26:05,838 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:26:05,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:26:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash 406746281, now seen corresponding path program 6 times [2021-12-22 16:26:05,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:26:05,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772684574] [2021-12-22 16:26:05,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:26:05,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:26:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:26:06,053 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-22 16:26:06,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:26:06,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772684574] [2021-12-22 16:26:06,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772684574] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:26:06,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435613437] [2021-12-22 16:26:06,053 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-22 16:26:06,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:26:06,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:26:06,056 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-22 16:26:06,064 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-22 16:26:06,161 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-22 16:26:06,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:26:06,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-22 16:26:06,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:26:06,417 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-22 16:26:06,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:26:06,624 INFO L387 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 22 treesize of output 18 [2021-12-22 16:26:06,807 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-22 16:26:06,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435613437] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:26:06,808 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:26:06,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2021-12-22 16:26:06,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533767507] [2021-12-22 16:26:06,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:26:06,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-22 16:26:06,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:26:06,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-22 16:26:06,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2021-12-22 16:26:06,809 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-22 16:26:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:26:07,209 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2021-12-22 16:26:07,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 16:26:07,210 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 states have internal predecessors, (102), 0 states have call successors, (0), 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-22 16:26:07,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:26:07,210 INFO L225 Difference]: With dead ends: 57 [2021-12-22 16:26:07,210 INFO L226 Difference]: Without dead ends: 57 [2021-12-22 16:26:07,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=437, Invalid=1633, Unknown=0, NotChecked=0, Total=2070 [2021-12-22 16:26:07,211 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 266 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:26:07,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 146 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:26:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-22 16:26:07,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-12-22 16:26:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 56 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-22 16:26:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2021-12-22 16:26:07,212 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 42 [2021-12-22 16:26:07,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:26:07,212 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2021-12-22 16:26:07,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-22 16:26:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2021-12-22 16:26:07,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-22 16:26:07,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:26:07,213 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:26:07,232 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-22 16:26:07,423 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,SelfDestructingSolverStorable24 [2021-12-22 16:26:07,423 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:26:07,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:26:07,424 INFO L85 PathProgramCache]: Analyzing trace with hash 892135217, now seen corresponding path program 7 times [2021-12-22 16:26:07,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:26:07,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856294587] [2021-12-22 16:26:07,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:26:07,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:26:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:26:07,820 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-22 16:26:07,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:26:07,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856294587] [2021-12-22 16:26:07,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856294587] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:26:07,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408965174] [2021-12-22 16:26:07,821 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-22 16:26:07,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:26:07,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:26:07,822 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-22 16:26:07,822 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-22 16:26:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:26:07,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 100 conjunts are in the unsatisfiable core [2021-12-22 16:26:07,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:26:07,917 INFO L387 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-22 16:26:08,126 INFO L387 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-22 16:26:08,252 INFO L387 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-22 16:26:08,315 INFO L387 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-22 16:26:08,362 INFO L387 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-22 16:26:08,380 INFO L387 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-22 16:26:08,388 INFO L387 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-22 16:26:08,393 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-22 16:26:08,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:26:08,427 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2021-12-22 16:26:08,433 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:08,439 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_502) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:08,445 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:08,451 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_501) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:08,457 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:08,463 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:08,469 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:08,473 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2021-12-22 16:26:08,477 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:26:08,477 INFO L387 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-22 16:26:08,482 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:26:08,482 INFO L387 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-22 16:26:08,485 INFO L387 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-22 16:26:08,723 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-22 16:26:08,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408965174] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:26:08,723 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:26:08,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 48 [2021-12-22 16:26:08,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850297191] [2021-12-22 16:26:08,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:26:08,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-22 16:26:08,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:26:08,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-22 16:26:08,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1375, Unknown=9, NotChecked=738, Total=2256 [2021-12-22 16:26:08,725 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-22 16:26:09,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:26:09,418 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2021-12-22 16:26:09,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-22 16:26:09,419 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 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-22 16:26:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:26:09,419 INFO L225 Difference]: With dead ends: 86 [2021-12-22 16:26:09,419 INFO L226 Difference]: Without dead ends: 64 [2021-12-22 16:26:09,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 65 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=196, Invalid=2087, Unknown=9, NotChecked=900, Total=3192 [2021-12-22 16:26:09,420 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 388 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:26:09,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 343 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 512 Invalid, 0 Unknown, 388 Unchecked, 0.2s Time] [2021-12-22 16:26:09,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-22 16:26:09,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2021-12-22 16:26:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:26:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2021-12-22 16:26:09,426 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 46 [2021-12-22 16:26:09,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:26:09,426 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2021-12-22 16:26:09,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-22 16:26:09,426 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2021-12-22 16:26:09,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-22 16:26:09,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:26:09,427 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:26:09,444 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-22 16:26:09,631 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,SelfDestructingSolverStorable25 [2021-12-22 16:26:09,631 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:26:09,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:26:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash -282507122, now seen corresponding path program 8 times [2021-12-22 16:26:09,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:26:09,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340642457] [2021-12-22 16:26:09,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:26:09,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:26:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:26:09,864 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-22 16:26:09,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:26:09,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340642457] [2021-12-22 16:26:09,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340642457] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:26:09,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390101766] [2021-12-22 16:26:09,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 16:26:09,864 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:26:09,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:26:09,865 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-22 16:26:09,867 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-22 16:26:09,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 16:26:09,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:26:09,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-22 16:26:09,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:26:10,210 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-22 16:26:10,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:26:10,474 INFO L387 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-22 16:26:10,522 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-22 16:26:10,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390101766] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:26:10,522 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:26:10,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2021-12-22 16:26:10,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109056990] [2021-12-22 16:26:10,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:26:10,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-22 16:26:10,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:26:10,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-22 16:26:10,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2021-12-22 16:26:10,524 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 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-22 16:26:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:26:11,023 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2021-12-22 16:26:11,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-22 16:26:11,023 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 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) Word has length 50 [2021-12-22 16:26:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:26:11,023 INFO L225 Difference]: With dead ends: 61 [2021-12-22 16:26:11,024 INFO L226 Difference]: Without dead ends: 61 [2021-12-22 16:26:11,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=449, Invalid=1903, Unknown=0, NotChecked=0, Total=2352 [2021-12-22 16:26:11,025 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 84 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:26:11,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 221 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:26:11,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-22 16:26:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-12-22 16:26:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 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-22 16:26:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2021-12-22 16:26:11,026 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 50 [2021-12-22 16:26:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:26:11,026 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2021-12-22 16:26:11,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 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-22 16:26:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2021-12-22 16:26:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-22 16:26:11,027 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:26:11,027 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:26:11,044 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-22 16:26:11,231 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,SelfDestructingSolverStorable26 [2021-12-22 16:26:11,231 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:26:11,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:26:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash 823214230, now seen corresponding path program 9 times [2021-12-22 16:26:11,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:26:11,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284288989] [2021-12-22 16:26:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:26:11,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:26:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:26:11,778 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-22 16:26:11,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:26:11,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284288989] [2021-12-22 16:26:11,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284288989] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:26:11,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610265575] [2021-12-22 16:26:11,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 16:26:11,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:26:11,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:26:11,780 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-22 16:26:11,781 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-22 16:26:11,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-12-22 16:26:11,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:26:11,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 153 conjunts are in the unsatisfiable core [2021-12-22 16:26:11,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:26:12,011 INFO L387 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-22 16:26:12,391 INFO L387 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-22 16:26:12,565 INFO L387 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-22 16:26:12,686 INFO L387 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-22 16:26:12,809 INFO L387 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-22 16:26:12,938 INFO L387 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-22 16:26:13,088 INFO L387 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-22 16:26:13,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:26:13,197 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:26:13,197 INFO L387 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-22 16:26:13,202 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-22 16:26:13,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:26:13,216 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2021-12-22 16:26:13,222 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:13,228 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_622) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:13,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:13,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_621) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:13,247 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:13,253 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_620) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:13,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:13,272 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_619) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:13,278 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:13,282 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2021-12-22 16:26:13,286 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:26:13,286 INFO L387 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-22 16:26:13,290 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:26:13,290 INFO L387 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-22 16:26:13,295 INFO L387 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-22 16:26:13,677 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-22 16:26:13,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610265575] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:26:13,677 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:26:13,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 69 [2021-12-22 16:26:13,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036536116] [2021-12-22 16:26:13,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:26:13,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2021-12-22 16:26:13,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:26:13,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-12-22 16:26:13,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=3127, Unknown=11, NotChecked=1342, Total=4692 [2021-12-22 16:26:13,679 INFO L87 Difference]: Start difference. First operand 61 states and 63 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-22 16:26:14,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:26:14,818 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2021-12-22 16:26:14,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-22 16:26:14,819 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-22 16:26:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:26:14,819 INFO L225 Difference]: With dead ends: 94 [2021-12-22 16:26:14,819 INFO L226 Difference]: Without dead ends: 68 [2021-12-22 16:26:14,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 11 IntricatePredicates, 5 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=361, Invalid=5834, Unknown=11, NotChecked=1804, Total=8010 [2021-12-22 16:26:14,821 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 48 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 727 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:26:14,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 533 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 706 Invalid, 0 Unknown, 727 Unchecked, 0.3s Time] [2021-12-22 16:26:14,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-22 16:26:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2021-12-22 16:26:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 64 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:26:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2021-12-22 16:26:14,822 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 54 [2021-12-22 16:26:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:26:14,823 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2021-12-22 16:26:14,823 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-22 16:26:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2021-12-22 16:26:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 16:26:14,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:26:14,823 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:26:14,842 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-22 16:26:15,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-22 16:26:15,035 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:26:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:26:15,036 INFO L85 PathProgramCache]: Analyzing trace with hash -101124877, now seen corresponding path program 10 times [2021-12-22 16:26:15,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:26:15,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221944313] [2021-12-22 16:26:15,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:26:15,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:26:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:26:15,271 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-22 16:26:15,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:26:15,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221944313] [2021-12-22 16:26:15,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221944313] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:26:15,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440592236] [2021-12-22 16:26:15,271 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-22 16:26:15,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:26:15,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:26:15,280 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-22 16:26:15,281 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-22 16:26:15,370 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-22 16:26:15,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:26:15,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 122 conjunts are in the unsatisfiable core [2021-12-22 16:26:15,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:26:15,391 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 16:26:15,391 INFO L387 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-22 16:26:15,397 INFO L387 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-22 16:26:15,724 INFO L387 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-22 16:26:15,890 INFO L387 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-22 16:26:16,011 INFO L387 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-22 16:26:16,119 INFO L387 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-22 16:26:16,234 INFO L387 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-22 16:26:16,341 INFO L387 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-22 16:26:16,441 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:26:16,441 INFO L387 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-22 16:26:16,569 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-22 16:26:16,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:26:17,410 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_696 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121| Int)) (or (<= (+ 7 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) 0) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2021-12-22 16:26:17,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_696 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121| Int)) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) (<= (+ 7 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) 0))) is different from false [2021-12-22 16:26:17,431 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:26:17,432 INFO L387 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-22 16:26:17,437 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:26:17,437 INFO L387 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-22 16:26:17,444 INFO L387 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-22 16:26:18,491 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-22 16:26:18,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440592236] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:26:18,491 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:26:18,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 25] total 66 [2021-12-22 16:26:18,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688117741] [2021-12-22 16:26:18,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:26:18,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2021-12-22 16:26:18,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:26:18,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-12-22 16:26:18,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=3727, Unknown=3, NotChecked=254, Total=4422 [2021-12-22 16:26:18,493 INFO L87 Difference]: Start difference. First operand 65 states and 67 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-22 16:26:20,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:26:20,317 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2021-12-22 16:26:20,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-22 16:26:20,318 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-22 16:26:20,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:26:20,318 INFO L225 Difference]: With dead ends: 68 [2021-12-22 16:26:20,318 INFO L226 Difference]: Without dead ends: 68 [2021-12-22 16:26:20,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1146, Invalid=6840, Unknown=32, NotChecked=354, Total=8372 [2021-12-22 16:26:20,320 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 112 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 374 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:26:20,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 338 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 780 Invalid, 0 Unknown, 374 Unchecked, 0.4s Time] [2021-12-22 16:26:20,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-22 16:26:20,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-22 16:26:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 67 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:26:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2021-12-22 16:26:20,322 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 58 [2021-12-22 16:26:20,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:26:20,322 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2021-12-22 16:26:20,322 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-22 16:26:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2021-12-22 16:26:20,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-22 16:26:20,323 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:26:20,323 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:26:20,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-22 16:26:20,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:26:20,538 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 5 more)] === [2021-12-22 16:26:20,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:26:20,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2106334426, now seen corresponding path program 4 times [2021-12-22 16:26:20,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:26:20,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255589456] [2021-12-22 16:26:20,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:26:20,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms