./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-lopstr16/flag_loopdep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-lopstr16/flag_loopdep.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea0eb860624f2529729bf06b2cf9cdf66fc11dde388f7654e825b0ff58526d73 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 10:56:37,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 10:56:37,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 10:56:37,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 10:56:37,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 10:56:37,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 10:56:37,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 10:56:37,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 10:56:37,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 10:56:38,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 10:56:38,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 10:56:38,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 10:56:38,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 10:56:38,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 10:56:38,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 10:56:38,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 10:56:38,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 10:56:38,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 10:56:38,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 10:56:38,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 10:56:38,019 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 10:56:38,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 10:56:38,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 10:56:38,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 10:56:38,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 10:56:38,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 10:56:38,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 10:56:38,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 10:56:38,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 10:56:38,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 10:56:38,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 10:56:38,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 10:56:38,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 10:56:38,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 10:56:38,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 10:56:38,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 10:56:38,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 10:56:38,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 10:56:38,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 10:56:38,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 10:56:38,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 10:56:38,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 10:56:38,042 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 10:56:38,073 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 10:56:38,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 10:56:38,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 10:56:38,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 10:56:38,075 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 10:56:38,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 10:56:38,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 10:56:38,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 10:56:38,076 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 10:56:38,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 10:56:38,077 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 10:56:38,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 10:56:38,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 10:56:38,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 10:56:38,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 10:56:38,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 10:56:38,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 10:56:38,078 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 10:56:38,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 10:56:38,079 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 10:56:38,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 10:56:38,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 10:56:38,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 10:56:38,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 10:56:38,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:56:38,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 10:56:38,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 10:56:38,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 10:56:38,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 10:56:38,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 10:56:38,081 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 10:56:38,081 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 10:56:38,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 10:56:38,082 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea0eb860624f2529729bf06b2cf9cdf66fc11dde388f7654e825b0ff58526d73 [2022-07-13 10:56:38,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 10:56:38,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 10:56:38,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 10:56:38,382 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 10:56:38,383 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 10:56:38,384 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2022-07-13 10:56:38,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e772831e/05e5547891814268950823d45a95f69f/FLAGb66224ae3 [2022-07-13 10:56:38,832 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 10:56:38,833 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2022-07-13 10:56:38,838 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e772831e/05e5547891814268950823d45a95f69f/FLAGb66224ae3 [2022-07-13 10:56:39,222 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e772831e/05e5547891814268950823d45a95f69f [2022-07-13 10:56:39,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 10:56:39,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 10:56:39,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 10:56:39,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 10:56:39,231 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 10:56:39,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:56:39" (1/1) ... [2022-07-13 10:56:39,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76c543f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:56:39, skipping insertion in model container [2022-07-13 10:56:39,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:56:39" (1/1) ... [2022-07-13 10:56:39,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 10:56:39,252 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 10:56:39,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-lopstr16/flag_loopdep.i[805,818] [2022-07-13 10:56:39,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:56:39,420 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 10:56:39,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-lopstr16/flag_loopdep.i[805,818] [2022-07-13 10:56:39,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:56:39,464 INFO L208 MainTranslator]: Completed translation [2022-07-13 10:56:39,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:56:39 WrapperNode [2022-07-13 10:56:39,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 10:56:39,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 10:56:39,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 10:56:39,466 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 10:56:39,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:56:39" (1/1) ... [2022-07-13 10:56:39,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:56:39" (1/1) ... [2022-07-13 10:56:39,499 INFO L137 Inliner]: procedures = 21, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2022-07-13 10:56:39,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 10:56:39,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 10:56:39,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 10:56:39,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 10:56:39,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:56:39" (1/1) ... [2022-07-13 10:56:39,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:56:39" (1/1) ... [2022-07-13 10:56:39,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:56:39" (1/1) ... [2022-07-13 10:56:39,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:56:39" (1/1) ... [2022-07-13 10:56:39,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:56:39" (1/1) ... [2022-07-13 10:56:39,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:56:39" (1/1) ... [2022-07-13 10:56:39,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:56:39" (1/1) ... [2022-07-13 10:56:39,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 10:56:39,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 10:56:39,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 10:56:39,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 10:56:39,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:56:39" (1/1) ... [2022-07-13 10:56:39,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:56:39,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:56:39,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 10:56:39,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 10:56:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 10:56:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 10:56:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 10:56:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 10:56:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 10:56:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 10:56:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 10:56:39,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 10:56:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 10:56:39,701 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 10:56:39,702 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 10:56:39,846 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 10:56:39,851 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 10:56:39,852 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 10:56:39,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:56:39 BoogieIcfgContainer [2022-07-13 10:56:39,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 10:56:39,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 10:56:39,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 10:56:39,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 10:56:39,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:56:39" (1/3) ... [2022-07-13 10:56:39,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e17cfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:56:39, skipping insertion in model container [2022-07-13 10:56:39,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:56:39" (2/3) ... [2022-07-13 10:56:39,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e17cfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:56:39, skipping insertion in model container [2022-07-13 10:56:39,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:56:39" (3/3) ... [2022-07-13 10:56:39,880 INFO L111 eAbstractionObserver]: Analyzing ICFG flag_loopdep.i [2022-07-13 10:56:39,891 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 10:56:39,905 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 10:56:39,952 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 10:56:39,958 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50e37fba, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@53d3e3ee [2022-07-13 10:56:39,958 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 10:56:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 10:56:39,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:56:39,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:56:39,972 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:56:39,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:56:39,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2060710478, now seen corresponding path program 1 times [2022-07-13 10:56:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:56:39,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889273479] [2022-07-13 10:56:39,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:56:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:56:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:56:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:56:40,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:56:40,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889273479] [2022-07-13 10:56:40,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889273479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:56:40,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:56:40,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 10:56:40,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45904354] [2022-07-13 10:56:40,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:56:40,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 10:56:40,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:56:40,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 10:56:40,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:56:40,224 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-07-13 10:56:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:56:40,236 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-07-13 10:56:40,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 10:56:40,239 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 [2022-07-13 10:56:40,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:56:40,244 INFO L225 Difference]: With dead ends: 36 [2022-07-13 10:56:40,245 INFO L226 Difference]: Without dead ends: 16 [2022-07-13 10:56:40,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:56:40,251 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:56:40,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:56:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-13 10:56:40,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-13 10:56:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-07-13 10:56:40,281 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2022-07-13 10:56:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:56:40,282 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-07-13 10:56:40,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-07-13 10:56:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-07-13 10:56:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 10:56:40,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:56:40,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:56:40,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 10:56:40,284 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:56:40,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:56:40,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1919336157, now seen corresponding path program 1 times [2022-07-13 10:56:40,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:56:40,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443485983] [2022-07-13 10:56:40,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:56:40,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:56:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:56:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:56:40,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:56:40,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443485983] [2022-07-13 10:56:40,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443485983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:56:40,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:56:40,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 10:56:40,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614015136] [2022-07-13 10:56:40,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:56:40,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 10:56:40,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:56:40,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 10:56:40,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:56:40,366 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:56:40,409 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-07-13 10:56:40,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 10:56:40,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-13 10:56:40,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:56:40,411 INFO L225 Difference]: With dead ends: 34 [2022-07-13 10:56:40,411 INFO L226 Difference]: Without dead ends: 26 [2022-07-13 10:56:40,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:56:40,415 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:56:40,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:56:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-13 10:56:40,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2022-07-13 10:56:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-07-13 10:56:40,424 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2022-07-13 10:56:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:56:40,425 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-07-13 10:56:40,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-07-13 10:56:40,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 10:56:40,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:56:40,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:56:40,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 10:56:40,429 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:56:40,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:56:40,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1200955363, now seen corresponding path program 1 times [2022-07-13 10:56:40,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:56:40,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385463816] [2022-07-13 10:56:40,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:56:40,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:56:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:56:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:56:40,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:56:40,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385463816] [2022-07-13 10:56:40,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385463816] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:56:40,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718170402] [2022-07-13 10:56:40,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:56:40,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:56:40,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:56:40,499 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:56:40,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 10:56:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:56:40,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 10:56:40,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:56:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:56:40,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 10:56:40,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718170402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:56:40,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 10:56:40,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-13 10:56:40,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545040658] [2022-07-13 10:56:40,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:56:40,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 10:56:40,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:56:40,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 10:56:40,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:56:40,599 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:56:40,610 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-07-13 10:56:40,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 10:56:40,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-07-13 10:56:40,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:56:40,611 INFO L225 Difference]: With dead ends: 31 [2022-07-13 10:56:40,611 INFO L226 Difference]: Without dead ends: 17 [2022-07-13 10:56:40,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:56:40,615 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:56:40,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 38 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:56:40,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-13 10:56:40,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-13 10:56:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-13 10:56:40,623 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2022-07-13 10:56:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:56:40,623 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-13 10:56:40,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-07-13 10:56:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 10:56:40,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:56:40,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:56:40,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 10:56:40,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:56:40,840 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:56:40,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:56:40,841 INFO L85 PathProgramCache]: Analyzing trace with hash 391608737, now seen corresponding path program 1 times [2022-07-13 10:56:40,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:56:40,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608358259] [2022-07-13 10:56:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:56:40,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:56:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:56:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:56:40,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:56:40,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608358259] [2022-07-13 10:56:40,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608358259] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:56:40,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821768640] [2022-07-13 10:56:40,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:56:40,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:56:40,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:56:40,885 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:56:40,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 10:56:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:56:40,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 10:56:40,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:56:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 10:56:41,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 10:56:41,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821768640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:56:41,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 10:56:41,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-13 10:56:41,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74001256] [2022-07-13 10:56:41,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:56:41,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 10:56:41,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:56:41,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 10:56:41,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:56:41,020 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:56:41,028 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-07-13 10:56:41,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 10:56:41,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-07-13 10:56:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:56:41,030 INFO L225 Difference]: With dead ends: 32 [2022-07-13 10:56:41,030 INFO L226 Difference]: Without dead ends: 19 [2022-07-13 10:56:41,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:56:41,031 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:56:41,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:56:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-13 10:56:41,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-07-13 10:56:41,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-13 10:56:41,034 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-07-13 10:56:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:56:41,035 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-13 10:56:41,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-07-13 10:56:41,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 10:56:41,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:56:41,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:56:41,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 10:56:41,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 10:56:41,252 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:56:41,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:56:41,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2027280351, now seen corresponding path program 1 times [2022-07-13 10:56:41,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:56:41,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160454632] [2022-07-13 10:56:41,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:56:41,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:56:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:56:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 10:56:41,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:56:41,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160454632] [2022-07-13 10:56:41,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160454632] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:56:41,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286507326] [2022-07-13 10:56:41,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:56:41,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:56:41,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:56:41,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:56:41,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 10:56:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:56:41,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 10:56:41,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:56:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 10:56:41,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:56:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 10:56:41,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286507326] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:56:41,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:56:41,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-13 10:56:41,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683429300] [2022-07-13 10:56:41,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:56:41,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 10:56:41,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:56:41,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 10:56:41,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-13 10:56:41,440 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:56:41,514 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-07-13 10:56:41,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 10:56:41,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-13 10:56:41,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:56:41,515 INFO L225 Difference]: With dead ends: 56 [2022-07-13 10:56:41,515 INFO L226 Difference]: Without dead ends: 43 [2022-07-13 10:56:41,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-13 10:56:41,517 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:56:41,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 48 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:56:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-13 10:56:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2022-07-13 10:56:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) 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) [2022-07-13 10:56:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-13 10:56:41,522 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 15 [2022-07-13 10:56:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:56:41,522 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-13 10:56:41,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-13 10:56:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 10:56:41,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:56:41,523 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:56:41,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 10:56:41,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:56:41,748 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:56:41,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:56:41,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2044266853, now seen corresponding path program 2 times [2022-07-13 10:56:41,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:56:41,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473243206] [2022-07-13 10:56:41,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:56:41,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:56:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:56:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 10:56:41,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:56:41,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473243206] [2022-07-13 10:56:41,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473243206] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:56:41,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648297625] [2022-07-13 10:56:41,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:56:41,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:56:41,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:56:41,881 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) [2022-07-13 10:56:41,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 10:56:41,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 10:56:41,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:56:41,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 10:56:41,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:56:42,054 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 10:56:42,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:56:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 10:56:42,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648297625] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:56:42,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:56:42,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2022-07-13 10:56:42,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914541090] [2022-07-13 10:56:42,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:56:42,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 10:56:42,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:56:42,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 10:56:42,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-07-13 10:56:42,156 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:56:42,244 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2022-07-13 10:56:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 10:56:42,245 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-13 10:56:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:56:42,248 INFO L225 Difference]: With dead ends: 81 [2022-07-13 10:56:42,248 INFO L226 Difference]: Without dead ends: 65 [2022-07-13 10:56:42,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-07-13 10:56:42,251 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:56:42,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 54 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:56:42,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-13 10:56:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 42. [2022-07-13 10:56:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-07-13 10:56:42,261 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 24 [2022-07-13 10:56:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:56:42,261 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-07-13 10:56:42,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-07-13 10:56:42,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 10:56:42,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:56:42,263 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:56:42,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 10:56:42,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:56:42,467 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:56:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:56:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1130748941, now seen corresponding path program 3 times [2022-07-13 10:56:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:56:42,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488129156] [2022-07-13 10:56:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:56:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:56:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:56:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-13 10:56:42,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:56:42,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488129156] [2022-07-13 10:56:42,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488129156] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:56:42,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107382602] [2022-07-13 10:56:42,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 10:56:42,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:56:42,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:56:42,610 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) [2022-07-13 10:56:42,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 10:56:42,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 10:56:42,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:56:42,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 10:56:42,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:56:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-13 10:56:42,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:56:43,020 INFO L356 Elim1Store]: treesize reduction 7, result has 41.7 percent of original size [2022-07-13 10:56:43,021 INFO L390 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 28 treesize of output 21 [2022-07-13 10:56:43,030 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 10:56:43,030 INFO L390 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 24 treesize of output 12 [2022-07-13 10:56:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-13 10:56:43,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107382602] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:56:43,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:56:43,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 15 [2022-07-13 10:56:43,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999822016] [2022-07-13 10:56:43,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:56:43,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 10:56:43,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:56:43,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 10:56:43,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-07-13 10:56:43,041 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:56:43,255 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2022-07-13 10:56:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 10:56:43,256 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-13 10:56:43,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:56:43,262 INFO L225 Difference]: With dead ends: 94 [2022-07-13 10:56:43,262 INFO L226 Difference]: Without dead ends: 86 [2022-07-13 10:56:43,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2022-07-13 10:56:43,264 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 101 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:56:43,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 110 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:56:43,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-13 10:56:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 48. [2022-07-13 10:56:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-07-13 10:56:43,280 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 39 [2022-07-13 10:56:43,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:56:43,281 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-07-13 10:56:43,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-07-13 10:56:43,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 10:56:43,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:56:43,284 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:56:43,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 10:56:43,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:56:43,507 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:56:43,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:56:43,508 INFO L85 PathProgramCache]: Analyzing trace with hash 927320518, now seen corresponding path program 1 times [2022-07-13 10:56:43,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:56:43,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054166754] [2022-07-13 10:56:43,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:56:43,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:56:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:56:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-07-13 10:56:43,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:56:43,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054166754] [2022-07-13 10:56:43,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054166754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:56:43,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:56:43,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 10:56:43,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228590964] [2022-07-13 10:56:43,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:56:43,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 10:56:43,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:56:43,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 10:56:43,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:56:43,607 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:43,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:56:43,619 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-07-13 10:56:43,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 10:56:43,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-13 10:56:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:56:43,620 INFO L225 Difference]: With dead ends: 55 [2022-07-13 10:56:43,620 INFO L226 Difference]: Without dead ends: 48 [2022-07-13 10:56:43,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:56:43,621 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:56:43,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:56:43,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-13 10:56:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-07-13 10:56:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-07-13 10:56:43,632 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2022-07-13 10:56:43,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:56:43,633 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-07-13 10:56:43,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:43,634 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-07-13 10:56:43,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 10:56:43,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:56:43,635 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:56:43,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 10:56:43,635 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:56:43,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:56:43,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2012771472, now seen corresponding path program 1 times [2022-07-13 10:56:43,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:56:43,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783729215] [2022-07-13 10:56:43,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:56:43,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:56:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:56:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-13 10:56:43,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:56:43,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783729215] [2022-07-13 10:56:43,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783729215] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:56:43,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067235982] [2022-07-13 10:56:43,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:56:43,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:56:43,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:56:43,715 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) [2022-07-13 10:56:43,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 10:56:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:56:43,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 10:56:43,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:56:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 10:56:44,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:56:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 10:56:44,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067235982] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:56:44,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:56:44,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 29 [2022-07-13 10:56:44,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652058603] [2022-07-13 10:56:44,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:56:44,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-13 10:56:44,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:56:44,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-13 10:56:44,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=516, Unknown=0, NotChecked=0, Total=812 [2022-07-13 10:56:44,306 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:56:44,431 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-07-13 10:56:44,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-13 10:56:44,432 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-13 10:56:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:56:44,433 INFO L225 Difference]: With dead ends: 132 [2022-07-13 10:56:44,433 INFO L226 Difference]: Without dead ends: 107 [2022-07-13 10:56:44,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=516, Unknown=0, NotChecked=0, Total=812 [2022-07-13 10:56:44,435 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 91 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:56:44,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 76 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:56:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-13 10:56:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2022-07-13 10:56:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-07-13 10:56:44,442 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 47 [2022-07-13 10:56:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:56:44,442 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-07-13 10:56:44,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-07-13 10:56:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-13 10:56:44,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:56:44,443 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:56:44,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 10:56:44,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:56:44,659 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:56:44,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:56:44,659 INFO L85 PathProgramCache]: Analyzing trace with hash 426637324, now seen corresponding path program 2 times [2022-07-13 10:56:44,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:56:44,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760599961] [2022-07-13 10:56:44,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:56:44,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:56:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:56:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2022-07-13 10:56:44,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:56:44,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760599961] [2022-07-13 10:56:44,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760599961] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:56:44,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700116979] [2022-07-13 10:56:44,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:56:44,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:56:44,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:56:44,802 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) [2022-07-13 10:56:44,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 10:56:44,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 10:56:44,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:56:44,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-13 10:56:45,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:56:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 10:56:45,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:56:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 10:56:46,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700116979] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:56:46,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:56:46,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 25, 25] total 54 [2022-07-13 10:56:46,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452724002] [2022-07-13 10:56:46,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:56:46,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-13 10:56:46,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:56:46,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-13 10:56:46,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=1707, Unknown=0, NotChecked=0, Total=2862 [2022-07-13 10:56:46,289 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 54 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 54 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:46,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:56:46,498 INFO L93 Difference]: Finished difference Result 193 states and 221 transitions. [2022-07-13 10:56:46,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-13 10:56:46,498 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 54 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-13 10:56:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:56:46,499 INFO L225 Difference]: With dead ends: 193 [2022-07-13 10:56:46,499 INFO L226 Difference]: Without dead ends: 165 [2022-07-13 10:56:46,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1155, Invalid=1707, Unknown=0, NotChecked=0, Total=2862 [2022-07-13 10:56:46,502 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 102 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 10:56:46,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 112 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 10:56:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-13 10:56:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2022-07-13 10:56:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.024) internal successors, (128), 125 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2022-07-13 10:56:46,522 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 74 [2022-07-13 10:56:46,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:56:46,524 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2022-07-13 10:56:46,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 54 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:46,524 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2022-07-13 10:56:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-13 10:56:46,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:56:46,530 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:56:46,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 10:56:46,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:56:46,751 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:56:46,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:56:46,751 INFO L85 PathProgramCache]: Analyzing trace with hash -374145592, now seen corresponding path program 3 times [2022-07-13 10:56:46,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:56:46,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513571827] [2022-07-13 10:56:46,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:56:46,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:56:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:56:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 2119 trivial. 0 not checked. [2022-07-13 10:56:46,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:56:46,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513571827] [2022-07-13 10:56:46,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513571827] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:56:46,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162966292] [2022-07-13 10:56:46,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 10:56:46,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:56:46,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:56:46,964 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) [2022-07-13 10:56:46,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 10:56:47,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 10:56:47,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:56:47,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-13 10:56:47,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:56:47,514 INFO L390 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 15 treesize of output 11 [2022-07-13 10:56:47,707 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 10:56:47,708 INFO L390 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 24 treesize of output 24 [2022-07-13 10:56:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 2063 trivial. 0 not checked. [2022-07-13 10:56:47,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:56:48,004 INFO L390 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 50 treesize of output 42 [2022-07-13 10:56:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 2063 trivial. 0 not checked. [2022-07-13 10:56:48,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162966292] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:56:48,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:56:48,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-07-13 10:56:48,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888548345] [2022-07-13 10:56:48,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:56:48,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 10:56:48,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:56:48,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 10:56:48,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-07-13 10:56:48,628 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:56:48,942 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-07-13 10:56:48,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 10:56:48,942 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2022-07-13 10:56:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:56:48,943 INFO L225 Difference]: With dead ends: 129 [2022-07-13 10:56:48,943 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 10:56:48,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 10:56:48,944 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:56:48,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 21 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 20 Unchecked, 0.0s Time] [2022-07-13 10:56:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 10:56:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 10:56:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 10:56:48,945 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2022-07-13 10:56:48,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:56:48,945 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 10:56:48,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:56:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 10:56:48,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 10:56:48,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 10:56:48,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 10:56:49,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-13 10:56:49,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 10:56:49,690 INFO L899 garLoopResultBuilder]: For program point L35-2(lines 35 41) no Hoare annotation was computed. [2022-07-13 10:56:49,690 INFO L895 garLoopResultBuilder]: At program point L35-3(lines 35 41) the Hoare annotation is: (let ((.cse0 (exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))) (.cse1 (= |ULTIMATE.start_main_~flag~0#1| 0)) (.cse2 (= |ULTIMATE.start_main_~#a~0#1.offset| 0))) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) .cse0 .cse1 .cse2 (< |ULTIMATE.start_main_~i~1#1| 1000000)) (and (= |ULTIMATE.start_main_~i~1#1| 0) .cse0 .cse1 .cse2) (<= 1 |ULTIMATE.start_main_~flag~0#1|))) [2022-07-13 10:56:49,690 INFO L899 garLoopResultBuilder]: For program point L35-4(lines 35 41) no Hoare annotation was computed. [2022-07-13 10:56:49,690 INFO L899 garLoopResultBuilder]: For program point L23-2(lines 23 26) no Hoare annotation was computed. [2022-07-13 10:56:49,691 INFO L895 garLoopResultBuilder]: At program point L23-3(lines 23 26) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|)) (.cse1 (= |ULTIMATE.start_init_~size#1| 1000000)) (.cse2 (= |ULTIMATE.start_main_~flag~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_init_~i~0#1| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= |ULTIMATE.start_init_~i~0#1| (+ |v_ULTIMATE.start_init_~i~0#1_86| 1)) (< |v_ULTIMATE.start_init_~i~0#1_86| |ULTIMATE.start_init_~size#1|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))))) [2022-07-13 10:56:49,691 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-07-13 10:56:49,691 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 10:56:49,691 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 10:56:49,691 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 10:56:49,691 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-07-13 10:56:49,691 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 27) no Hoare annotation was computed. [2022-07-13 10:56:49,691 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 40) no Hoare annotation was computed. [2022-07-13 10:56:49,691 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 10:56:49,691 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-07-13 10:56:49,691 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2022-07-13 10:56:49,691 INFO L899 garLoopResultBuilder]: For program point L13-3(line 13) no Hoare annotation was computed. [2022-07-13 10:56:49,692 INFO L899 garLoopResultBuilder]: For program point L42-2(lines 42 46) no Hoare annotation was computed. [2022-07-13 10:56:49,692 INFO L895 garLoopResultBuilder]: At program point L42-3(lines 42 46) the Hoare annotation is: (<= 1 |ULTIMATE.start_main_~flag~0#1|) [2022-07-13 10:56:49,692 INFO L899 garLoopResultBuilder]: For program point L42-4(lines 42 46) no Hoare annotation was computed. [2022-07-13 10:56:49,692 INFO L902 garLoopResultBuilder]: At program point L47(lines 28 48) the Hoare annotation is: true [2022-07-13 10:56:49,694 INFO L356 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2022-07-13 10:56:49,695 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 10:56:49,702 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,703 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,706 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,709 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,710 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,710 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,720 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 10:56:49,721 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,721 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,721 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,721 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,722 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,722 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,722 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,722 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,722 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 10:56:49,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,724 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,724 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,724 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,724 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,725 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,725 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,725 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 10:56:49 BoogieIcfgContainer [2022-07-13 10:56:49,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 10:56:49,727 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 10:56:49,727 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 10:56:49,727 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 10:56:49,728 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:56:39" (3/4) ... [2022-07-13 10:56:49,730 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 10:56:49,738 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-07-13 10:56:49,738 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 10:56:49,738 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 10:56:49,738 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 10:56:49,757 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((a == a && size == 1000000) && flag == 0) && a == 0) && a == a) && i <= 0) || (((((a == a && size == 1000000) && flag == 0) && a == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0#1_86 : int :: (i <= v_ULTIMATE.start_init_~i~0#1_86 + 1 && v_ULTIMATE.start_init_~i~0#1_86 < size) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0#1_86 * 4] == 0))) [2022-07-13 10:56:49,758 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((#memory_$Pointer$[a][a] == 0 && #memory_$Pointer$[a][a] == 0) && (\exists v_ULTIMATE.start_init_~i~0#1_86 : int :: (999999 <= v_ULTIMATE.start_init_~i~0#1_86 && v_ULTIMATE.start_init_~i~0#1_86 < 1000000) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0#1_86 * 4] == 0))) && flag == 0) && a == 0) && i < 1000000) || (((i == 0 && (\exists v_ULTIMATE.start_init_~i~0#1_86 : int :: (999999 <= v_ULTIMATE.start_init_~i~0#1_86 && v_ULTIMATE.start_init_~i~0#1_86 < 1000000) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0#1_86 * 4] == 0))) && flag == 0) && a == 0)) || 1 <= flag [2022-07-13 10:56:49,764 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 10:56:49,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 10:56:49,765 INFO L158 Benchmark]: Toolchain (without parser) took 10539.57ms. Allocated memory was 79.7MB in the beginning and 211.8MB in the end (delta: 132.1MB). Free memory was 41.5MB in the beginning and 169.2MB in the end (delta: -127.7MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2022-07-13 10:56:49,765 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 79.7MB. Free memory was 58.0MB in the beginning and 58.0MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 10:56:49,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.03ms. Allocated memory was 79.7MB in the beginning and 121.6MB in the end (delta: 41.9MB). Free memory was 41.3MB in the beginning and 100.0MB in the end (delta: -58.7MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2022-07-13 10:56:49,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.96ms. Allocated memory is still 121.6MB. Free memory was 100.0MB in the beginning and 98.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 10:56:49,766 INFO L158 Benchmark]: Boogie Preprocessor took 43.50ms. Allocated memory is still 121.6MB. Free memory was 98.6MB in the beginning and 97.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 10:56:49,766 INFO L158 Benchmark]: RCFGBuilder took 309.06ms. Allocated memory is still 121.6MB. Free memory was 97.2MB in the beginning and 86.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 10:56:49,767 INFO L158 Benchmark]: TraceAbstraction took 9870.82ms. Allocated memory was 121.6MB in the beginning and 211.8MB in the end (delta: 90.2MB). Free memory was 86.0MB in the beginning and 172.4MB in the end (delta: -86.4MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2022-07-13 10:56:49,767 INFO L158 Benchmark]: Witness Printer took 37.73ms. Allocated memory is still 211.8MB. Free memory was 172.4MB in the beginning and 169.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 10:56:49,768 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 79.7MB. Free memory was 58.0MB in the beginning and 58.0MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.03ms. Allocated memory was 79.7MB in the beginning and 121.6MB in the end (delta: 41.9MB). Free memory was 41.3MB in the beginning and 100.0MB in the end (delta: -58.7MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.96ms. Allocated memory is still 121.6MB. Free memory was 100.0MB in the beginning and 98.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.50ms. Allocated memory is still 121.6MB. Free memory was 98.6MB in the beginning and 97.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 309.06ms. Allocated memory is still 121.6MB. Free memory was 97.2MB in the beginning and 86.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9870.82ms. Allocated memory was 121.6MB in the beginning and 211.8MB in the end (delta: 90.2MB). Free memory was 86.0MB in the beginning and 172.4MB in the end (delta: -86.4MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. * Witness Printer took 37.73ms. Allocated memory is still 211.8MB. Free memory was 172.4MB in the beginning and 169.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 11, TraceHistogramMax: 46, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 559 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 20 IncrementalHoareTripleChecker+Unchecked, 400 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 543 IncrementalHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 159 mSDtfsCounter, 543 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 749 GetRequests, 587 SyntacticMatches, 3 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=10, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 158 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 61 NumberOfFragments, 140 HoareAnnotationTreeSize, 4 FomulaSimplifications, 69 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 4 FomulaSimplificationsInter, 2237 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 765 NumberOfCodeBlocks, 646 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1064 ConstructedInterpolants, 37 QuantifiedInterpolants, 6510 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1819 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 7432/8984 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant [2022-07-13 10:56:49,778 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,778 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,778 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,779 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,779 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] Derived loop invariant: (((((a == a && size == 1000000) && flag == 0) && a == 0) && a == a) && i <= 0) || (((((a == a && size == 1000000) && flag == 0) && a == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0#1_86 : int :: (i <= v_ULTIMATE.start_init_~i~0#1_86 + 1 && v_ULTIMATE.start_init_~i~0#1_86 < size) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0#1_86 * 4] == 0))) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 <= flag - InvariantResult [Line: 35]: Loop Invariant [2022-07-13 10:56:49,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 10:56:49,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,781 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,781 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 10:56:49,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-07-13 10:56:49,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 10:56:49,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] Derived loop invariant: ((((((#memory_$Pointer$[a][a] == 0 && #memory_$Pointer$[a][a] == 0) && (\exists v_ULTIMATE.start_init_~i~0#1_86 : int :: (999999 <= v_ULTIMATE.start_init_~i~0#1_86 && v_ULTIMATE.start_init_~i~0#1_86 < 1000000) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0#1_86 * 4] == 0))) && flag == 0) && a == 0) && i < 1000000) || (((i == 0 && (\exists v_ULTIMATE.start_init_~i~0#1_86 : int :: (999999 <= v_ULTIMATE.start_init_~i~0#1_86 && v_ULTIMATE.start_init_~i~0#1_86 < 1000000) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0#1_86 * 4] == 0))) && flag == 0) && a == 0)) || 1 <= flag RESULT: Ultimate proved your program to be correct! [2022-07-13 10:56:49,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE