./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-examples/data_structures_set_multi_proc_trivial_ground.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 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:01:14,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:01:14,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:01:14,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:01:14,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:01:14,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:01:14,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:01:14,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:01:14,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:01:14,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:01:14,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:01:14,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:01:14,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:01:14,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:01:14,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:01:14,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:01:14,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:01:14,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:01:14,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:01:14,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:01:14,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:01:14,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:01:14,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:01:14,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:01:14,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:01:14,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:01:14,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:01:14,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:01:14,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:01:14,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:01:14,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:01:14,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:01:14,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:01:14,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:01:14,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:01:14,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:01:14,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:01:14,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:01:14,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:01:14,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:01:14,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:01:14,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:01:14,797 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:01:14,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:01:14,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:01:14,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:01:14,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:01:14,802 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:01:14,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:01:14,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:01:14,803 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:01:14,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:01:14,804 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:01:14,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:01:14,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:01:14,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:01:14,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:01:14,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:01:14,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:01:14,805 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:01:14,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:01:14,806 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:01:14,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:01:14,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:01:14,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:01:14,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:01:14,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:01:14,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:01:14,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:01:14,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:01:14,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:01:14,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:01:14,809 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:01:14,809 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:01:14,810 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:01:14,810 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 -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2022-02-20 14:01:15,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:01:15,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:01:15,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:01:15,066 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:01:15,067 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:01:15,069 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2022-02-20 14:01:15,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f05b3ae49/9520d401fa4b4a39a71ddd4688e74720/FLAG6f9b86f8a [2022-02-20 14:01:15,577 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:01:15,578 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2022-02-20 14:01:15,582 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f05b3ae49/9520d401fa4b4a39a71ddd4688e74720/FLAG6f9b86f8a [2022-02-20 14:01:16,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f05b3ae49/9520d401fa4b4a39a71ddd4688e74720 [2022-02-20 14:01:16,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:01:16,021 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:01:16,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:01:16,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:01:16,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:01:16,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:01:16" (1/1) ... [2022-02-20 14:01:16,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c48435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:16, skipping insertion in model container [2022-02-20 14:01:16,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:01:16" (1/1) ... [2022-02-20 14:01:16,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:01:16,063 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:01:16,230 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-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2022-02-20 14:01:16,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:01:16,297 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:01:16,325 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-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2022-02-20 14:01:16,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:01:16,360 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:01:16,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:16 WrapperNode [2022-02-20 14:01:16,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:01:16,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:01:16,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:01:16,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:01:16,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:16" (1/1) ... [2022-02-20 14:01:16,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:16" (1/1) ... [2022-02-20 14:01:16,426 INFO L137 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 158 [2022-02-20 14:01:16,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:01:16,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:01:16,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:01:16,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:01:16,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:16" (1/1) ... [2022-02-20 14:01:16,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:16" (1/1) ... [2022-02-20 14:01:16,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:16" (1/1) ... [2022-02-20 14:01:16,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:16" (1/1) ... [2022-02-20 14:01:16,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:16" (1/1) ... [2022-02-20 14:01:16,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:16" (1/1) ... [2022-02-20 14:01:16,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:16" (1/1) ... [2022-02-20 14:01:16,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:01:16,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:01:16,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:01:16,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:01:16,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:16" (1/1) ... [2022-02-20 14:01:16,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:01:16,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:16,533 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-02-20 14:01:16,542 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-02-20 14:01:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:01:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:01:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:01:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:01:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:01:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:01:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:01:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 14:01:16,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 14:01:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:01:16,637 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:01:16,639 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:01:16,967 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:01:16,974 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:01:16,974 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 14:01:16,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:01:16 BoogieIcfgContainer [2022-02-20 14:01:16,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:01:16,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:01:16,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:01:16,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:01:16,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:01:16" (1/3) ... [2022-02-20 14:01:16,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26caa561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:01:16, skipping insertion in model container [2022-02-20 14:01:16,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:16" (2/3) ... [2022-02-20 14:01:16,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26caa561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:01:16, skipping insertion in model container [2022-02-20 14:01:16,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:01:16" (3/3) ... [2022-02-20 14:01:16,984 INFO L111 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2022-02-20 14:01:16,990 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:01:16,990 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:01:17,037 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:01:17,044 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:01:17,045 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:01:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:01:17,073 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:17,074 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:17,075 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:17,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:17,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1977750346, now seen corresponding path program 1 times [2022-02-20 14:01:17,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:17,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877664243] [2022-02-20 14:01:17,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:17,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:17,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {51#true} is VALID [2022-02-20 14:01:17,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {53#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:17,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {53#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !(main_~x~0#1 < 100000); {52#false} is VALID [2022-02-20 14:01:17,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {52#false} main_~x~0#1 := 0; {52#false} is VALID [2022-02-20 14:01:17,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {52#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {52#false} is VALID [2022-02-20 14:01:17,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {52#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {52#false} is VALID [2022-02-20 14:01:17,271 INFO L272 TraceCheckUtils]: 6: Hoare triple {52#false} call __VERIFIER_assert((if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0)); {52#false} is VALID [2022-02-20 14:01:17,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {52#false} ~cond := #in~cond; {52#false} is VALID [2022-02-20 14:01:17,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {52#false} assume 0 == ~cond; {52#false} is VALID [2022-02-20 14:01:17,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {52#false} assume !false; {52#false} is VALID [2022-02-20 14:01:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:01:17,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:17,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877664243] [2022-02-20 14:01:17,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877664243] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:01:17,276 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:01:17,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:01:17,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625950514] [2022-02-20 14:01:17,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:01:17,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:01:17,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:17,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:17,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:01:17,314 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:17,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:01:17,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:01:17,340 INFO L87 Difference]: Start difference. First operand has 48 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:17,611 INFO L93 Difference]: Finished difference Result 131 states and 207 transitions. [2022-02-20 14:01:17,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:01:17,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:01:17,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2022-02-20 14:01:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2022-02-20 14:01:17,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 207 transitions. [2022-02-20 14:01:17,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:17,826 INFO L225 Difference]: With dead ends: 131 [2022-02-20 14:01:17,827 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 14:01:17,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:01:17,834 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 40 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:17,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 92 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:01:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 14:01:17,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 45. [2022-02-20 14:01:17,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:17,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:17,873 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:17,874 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:17,882 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2022-02-20 14:01:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 105 transitions. [2022-02-20 14:01:17,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:17,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:17,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 79 states. [2022-02-20 14:01:17,885 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 79 states. [2022-02-20 14:01:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:17,890 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2022-02-20 14:01:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 105 transitions. [2022-02-20 14:01:17,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:17,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:17,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:17,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:17,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2022-02-20 14:01:17,895 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 10 [2022-02-20 14:01:17,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:17,896 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2022-02-20 14:01:17,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-02-20 14:01:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 14:01:17,904 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:17,904 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:17,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:01:17,905 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:17,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:17,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1322552780, now seen corresponding path program 1 times [2022-02-20 14:01:17,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:17,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812474307] [2022-02-20 14:01:17,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:17,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:17,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {456#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {456#true} is VALID [2022-02-20 14:01:17,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {458#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:17,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {458#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:17,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {458#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {459#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:17,968 INFO L290 TraceCheckUtils]: 4: Hoare triple {459#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !(main_~x~0#1 < 100000); {457#false} is VALID [2022-02-20 14:01:17,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#false} main_~x~0#1 := 0; {457#false} is VALID [2022-02-20 14:01:17,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {457#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {457#false} is VALID [2022-02-20 14:01:17,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {457#false} is VALID [2022-02-20 14:01:17,969 INFO L272 TraceCheckUtils]: 8: Hoare triple {457#false} call __VERIFIER_assert((if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0)); {457#false} is VALID [2022-02-20 14:01:17,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#false} ~cond := #in~cond; {457#false} is VALID [2022-02-20 14:01:17,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {457#false} assume 0 == ~cond; {457#false} is VALID [2022-02-20 14:01:17,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {457#false} assume !false; {457#false} is VALID [2022-02-20 14:01:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:01:17,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:17,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812474307] [2022-02-20 14:01:17,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812474307] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:01:17,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631055016] [2022-02-20 14:01:17,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:17,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:17,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:17,975 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-02-20 14:01:18,013 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-02-20 14:01:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:18,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:01:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:18,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:01:18,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {456#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {456#true} is VALID [2022-02-20 14:01:18,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {466#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:18,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {466#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:18,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {466#(<= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {459#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:18,188 INFO L290 TraceCheckUtils]: 4: Hoare triple {459#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !(main_~x~0#1 < 100000); {457#false} is VALID [2022-02-20 14:01:18,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#false} main_~x~0#1 := 0; {457#false} is VALID [2022-02-20 14:01:18,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {457#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {457#false} is VALID [2022-02-20 14:01:18,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {457#false} is VALID [2022-02-20 14:01:18,189 INFO L272 TraceCheckUtils]: 8: Hoare triple {457#false} call __VERIFIER_assert((if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0)); {457#false} is VALID [2022-02-20 14:01:18,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#false} ~cond := #in~cond; {457#false} is VALID [2022-02-20 14:01:18,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {457#false} assume 0 == ~cond; {457#false} is VALID [2022-02-20 14:01:18,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {457#false} assume !false; {457#false} is VALID [2022-02-20 14:01:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:01:18,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:01:18,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {457#false} assume !false; {457#false} is VALID [2022-02-20 14:01:18,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {457#false} assume 0 == ~cond; {457#false} is VALID [2022-02-20 14:01:18,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#false} ~cond := #in~cond; {457#false} is VALID [2022-02-20 14:01:18,282 INFO L272 TraceCheckUtils]: 8: Hoare triple {457#false} call __VERIFIER_assert((if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0)); {457#false} is VALID [2022-02-20 14:01:18,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {457#false} is VALID [2022-02-20 14:01:18,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {457#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {457#false} is VALID [2022-02-20 14:01:18,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#false} main_~x~0#1 := 0; {457#false} is VALID [2022-02-20 14:01:18,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {518#(< |ULTIMATE.start_main_~x~0#1| 100000)} assume !(main_~x~0#1 < 100000); {457#false} is VALID [2022-02-20 14:01:18,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {522#(< |ULTIMATE.start_main_~x~0#1| 99999)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {518#(< |ULTIMATE.start_main_~x~0#1| 100000)} is VALID [2022-02-20 14:01:18,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {522#(< |ULTIMATE.start_main_~x~0#1| 99999)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {522#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-20 14:01:18,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {522#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-20 14:01:18,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {456#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {456#true} is VALID [2022-02-20 14:01:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:01:18,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631055016] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:01:18,287 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:01:18,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:01:18,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50461411] [2022-02-20 14:01:18,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:01:18,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:01:18,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:18,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:18,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:01:18,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:18,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:01:18,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:01:18,315 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:18,799 INFO L93 Difference]: Finished difference Result 223 states and 303 transitions. [2022-02-20 14:01:18,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:01:18,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:01:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2022-02-20 14:01:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2022-02-20 14:01:18,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 303 transitions. [2022-02-20 14:01:19,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 303 edges. 303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:19,112 INFO L225 Difference]: With dead ends: 223 [2022-02-20 14:01:19,112 INFO L226 Difference]: Without dead ends: 183 [2022-02-20 14:01:19,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:01:19,115 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 181 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:19,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 255 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:01:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-02-20 14:01:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 51. [2022-02-20 14:01:19,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:19,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:19,138 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:19,139 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:19,150 INFO L93 Difference]: Finished difference Result 183 states and 248 transitions. [2022-02-20 14:01:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 248 transitions. [2022-02-20 14:01:19,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:19,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:19,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 183 states. [2022-02-20 14:01:19,158 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 183 states. [2022-02-20 14:01:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:19,170 INFO L93 Difference]: Finished difference Result 183 states and 248 transitions. [2022-02-20 14:01:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 248 transitions. [2022-02-20 14:01:19,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:19,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:19,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:19,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2022-02-20 14:01:19,173 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 12 [2022-02-20 14:01:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:19,174 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2022-02-20 14:01:19,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-02-20 14:01:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:01:19,175 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:19,175 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:19,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 14:01:19,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:19,396 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:19,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:19,397 INFO L85 PathProgramCache]: Analyzing trace with hash -201790894, now seen corresponding path program 2 times [2022-02-20 14:01:19,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:19,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429120721] [2022-02-20 14:01:19,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:19,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:19,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {1282#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {1282#true} is VALID [2022-02-20 14:01:19,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {1282#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:19,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:19,530 INFO L290 TraceCheckUtils]: 3: Hoare triple {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:19,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:19,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:19,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:19,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:19,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:19,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:19,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !(main_~x~0#1 < 100000); {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:19,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {1284#(= |ULTIMATE.start_main_~n~0#1| 0)} main_~x~0#1 := 0; {1285#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 14:01:19,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {1285#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {1283#false} is VALID [2022-02-20 14:01:19,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {1283#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {1283#false} is VALID [2022-02-20 14:01:19,535 INFO L272 TraceCheckUtils]: 14: Hoare triple {1283#false} call __VERIFIER_assert((if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0)); {1283#false} is VALID [2022-02-20 14:01:19,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {1283#false} ~cond := #in~cond; {1283#false} is VALID [2022-02-20 14:01:19,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {1283#false} assume 0 == ~cond; {1283#false} is VALID [2022-02-20 14:01:19,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {1283#false} assume !false; {1283#false} is VALID [2022-02-20 14:01:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 14:01:19,536 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:19,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429120721] [2022-02-20 14:01:19,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429120721] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:01:19,537 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:01:19,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:01:19,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283977054] [2022-02-20 14:01:19,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:01:19,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:01:19,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:19,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:19,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:01:19,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:19,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:01:19,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:01:19,549 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:19,664 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2022-02-20 14:01:19,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:01:19,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:01:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-02-20 14:01:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-02-20 14:01:19,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 121 transitions. [2022-02-20 14:01:19,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:19,757 INFO L225 Difference]: With dead ends: 98 [2022-02-20 14:01:19,758 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 14:01:19,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:01:19,759 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:19,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:01:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 14:01:19,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-02-20 14:01:19,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:19,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 56 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:19,767 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 56 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:19,768 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 56 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:19,770 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-02-20 14:01:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-02-20 14:01:19,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:19,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:19,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-02-20 14:01:19,771 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-02-20 14:01:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:19,773 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-02-20 14:01:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-02-20 14:01:19,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:19,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:19,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:19,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2022-02-20 14:01:19,776 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 18 [2022-02-20 14:01:19,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:19,776 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2022-02-20 14:01:19,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,777 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-02-20 14:01:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 14:01:19,777 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:19,777 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:19,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:01:19,778 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:19,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:19,779 INFO L85 PathProgramCache]: Analyzing trace with hash 8512802, now seen corresponding path program 1 times [2022-02-20 14:01:19,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:19,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226329151] [2022-02-20 14:01:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:19,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:19,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {1617#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {1617#true} is VALID [2022-02-20 14:01:19,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {1617#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {1617#true} is VALID [2022-02-20 14:01:19,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {1617#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1617#true} is VALID [2022-02-20 14:01:19,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {1617#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1617#true} is VALID [2022-02-20 14:01:19,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {1617#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1617#true} is VALID [2022-02-20 14:01:19,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {1617#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1617#true} is VALID [2022-02-20 14:01:19,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {1617#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1617#true} is VALID [2022-02-20 14:01:19,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {1617#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1617#true} is VALID [2022-02-20 14:01:19,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {1617#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1617#true} is VALID [2022-02-20 14:01:19,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {1617#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1617#true} is VALID [2022-02-20 14:01:19,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {1617#true} assume !(main_~x~0#1 < 100000); {1617#true} is VALID [2022-02-20 14:01:19,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {1617#true} main_~x~0#1 := 0; {1617#true} is VALID [2022-02-20 14:01:19,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {1617#true} assume !(main_~x~0#1 < main_~n~0#1); {1617#true} is VALID [2022-02-20 14:01:19,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {1617#true} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {1619#(= |ULTIMATE.start_main_~v~0#1| 0)} is VALID [2022-02-20 14:01:19,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {1619#(= |ULTIMATE.start_main_~v~0#1| 0)} assume !(main_~v~0#1 < 100000); {1618#false} is VALID [2022-02-20 14:01:19,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {1618#false} main_~v~0#1 := 0; {1618#false} is VALID [2022-02-20 14:01:19,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {1618#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {1618#false} is VALID [2022-02-20 14:01:19,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {1618#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {1618#false} is VALID [2022-02-20 14:01:19,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {1618#false} elem_exists_#res#1 := 0; {1618#false} is VALID [2022-02-20 14:01:19,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {1618#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {1618#false} is VALID [2022-02-20 14:01:19,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {1618#false} assume 0 != main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {1618#false} is VALID [2022-02-20 14:01:19,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {1618#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {1618#false} is VALID [2022-02-20 14:01:19,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {1618#false} main_~x~0#1 := 0; {1618#false} is VALID [2022-02-20 14:01:19,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {1618#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {1618#false} is VALID [2022-02-20 14:01:19,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {1618#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {1618#false} is VALID [2022-02-20 14:01:19,843 INFO L272 TraceCheckUtils]: 25: Hoare triple {1618#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {1618#false} is VALID [2022-02-20 14:01:19,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {1618#false} ~cond := #in~cond; {1618#false} is VALID [2022-02-20 14:01:19,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {1618#false} assume 0 == ~cond; {1618#false} is VALID [2022-02-20 14:01:19,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {1618#false} assume !false; {1618#false} is VALID [2022-02-20 14:01:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 14:01:19,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:19,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226329151] [2022-02-20 14:01:19,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226329151] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:01:19,845 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:01:19,845 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:01:19,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920454441] [2022-02-20 14:01:19,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:01:19,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 14:01:19,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:19,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:19,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:01:19,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:19,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:01:19,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:01:19,868 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:19,950 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2022-02-20 14:01:19,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:01:19,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 14:01:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-20 14:01:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-20 14:01:19,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-02-20 14:01:20,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:20,030 INFO L225 Difference]: With dead ends: 117 [2022-02-20 14:01:20,031 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 14:01:20,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:01:20,032 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 20 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:20,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 84 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:01:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 14:01:20,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2022-02-20 14:01:20,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:20,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 57 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:20,041 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 57 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:20,041 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 57 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:20,043 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-02-20 14:01:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-02-20 14:01:20,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:20,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:20,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 77 states. [2022-02-20 14:01:20,045 INFO L87 Difference]: Start difference. First operand has 57 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 77 states. [2022-02-20 14:01:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:20,047 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-02-20 14:01:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-02-20 14:01:20,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:20,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:20,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:20,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-02-20 14:01:20,050 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 29 [2022-02-20 14:01:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:20,051 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-02-20 14:01:20,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:20,051 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-02-20 14:01:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:01:20,052 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:20,052 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:20,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:01:20,052 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:20,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash 383662240, now seen corresponding path program 1 times [2022-02-20 14:01:20,053 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:20,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688637890] [2022-02-20 14:01:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:20,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:20,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {2019#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {2019#true} is VALID [2022-02-20 14:01:20,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {2019#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {2019#true} is VALID [2022-02-20 14:01:20,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {2019#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2019#true} is VALID [2022-02-20 14:01:20,150 INFO L290 TraceCheckUtils]: 3: Hoare triple {2019#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2019#true} is VALID [2022-02-20 14:01:20,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {2019#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2019#true} is VALID [2022-02-20 14:01:20,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {2019#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2019#true} is VALID [2022-02-20 14:01:20,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {2019#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2019#true} is VALID [2022-02-20 14:01:20,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {2019#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2019#true} is VALID [2022-02-20 14:01:20,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {2019#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2019#true} is VALID [2022-02-20 14:01:20,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {2019#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2019#true} is VALID [2022-02-20 14:01:20,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {2019#true} assume !(main_~x~0#1 < 100000); {2019#true} is VALID [2022-02-20 14:01:20,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {2019#true} main_~x~0#1 := 0; {2019#true} is VALID [2022-02-20 14:01:20,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {2019#true} assume !(main_~x~0#1 < main_~n~0#1); {2019#true} is VALID [2022-02-20 14:01:20,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {2019#true} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {2021#(= |ULTIMATE.start_main_~v~0#1| 0)} is VALID [2022-02-20 14:01:20,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {2021#(= |ULTIMATE.start_main_~v~0#1| 0)} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {2021#(= |ULTIMATE.start_main_~v~0#1| 0)} is VALID [2022-02-20 14:01:20,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {2021#(= |ULTIMATE.start_main_~v~0#1| 0)} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2022#(<= |ULTIMATE.start_main_~v~0#1| 1)} is VALID [2022-02-20 14:01:20,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {2022#(<= |ULTIMATE.start_main_~v~0#1| 1)} assume !(main_~v~0#1 < 100000); {2020#false} is VALID [2022-02-20 14:01:20,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {2020#false} main_~v~0#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {2020#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {2020#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {2020#false} is VALID [2022-02-20 14:01:20,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {2020#false} elem_exists_#res#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {2020#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {2020#false} is VALID [2022-02-20 14:01:20,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {2020#false} assume 0 != main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {2020#false} is VALID [2022-02-20 14:01:20,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {2020#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {2020#false} is VALID [2022-02-20 14:01:20,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {2020#false} main_~x~0#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {2020#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {2020#false} is VALID [2022-02-20 14:01:20,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {2020#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {2020#false} is VALID [2022-02-20 14:01:20,160 INFO L272 TraceCheckUtils]: 27: Hoare triple {2020#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {2020#false} is VALID [2022-02-20 14:01:20,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {2020#false} ~cond := #in~cond; {2020#false} is VALID [2022-02-20 14:01:20,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {2020#false} assume 0 == ~cond; {2020#false} is VALID [2022-02-20 14:01:20,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {2020#false} assume !false; {2020#false} is VALID [2022-02-20 14:01:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 14:01:20,161 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:20,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688637890] [2022-02-20 14:01:20,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688637890] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:01:20,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754743425] [2022-02-20 14:01:20,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:20,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:20,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:20,163 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-02-20 14:01:20,164 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-02-20 14:01:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:20,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:01:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:20,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:01:20,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {2019#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {2019#true} is VALID [2022-02-20 14:01:20,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {2019#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {2029#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:20,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {2029#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2029#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 14:01:20,420 INFO L290 TraceCheckUtils]: 3: Hoare triple {2029#(<= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2036#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:20,420 INFO L290 TraceCheckUtils]: 4: Hoare triple {2036#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2036#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 14:01:20,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {2036#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2043#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:20,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {2043#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2043#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-20 14:01:20,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {2043#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2050#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:20,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {2050#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2050#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-20 14:01:20,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {2050#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2057#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-20 14:01:20,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {2057#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !(main_~x~0#1 < 100000); {2020#false} is VALID [2022-02-20 14:01:20,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {2020#false} main_~x~0#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {2020#false} assume !(main_~x~0#1 < main_~n~0#1); {2020#false} is VALID [2022-02-20 14:01:20,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {2020#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {2020#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {2020#false} is VALID [2022-02-20 14:01:20,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {2020#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2020#false} is VALID [2022-02-20 14:01:20,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {2020#false} assume !(main_~v~0#1 < 100000); {2020#false} is VALID [2022-02-20 14:01:20,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {2020#false} main_~v~0#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {2020#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {2020#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {2020#false} is VALID [2022-02-20 14:01:20,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {2020#false} elem_exists_#res#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {2020#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {2020#false} is VALID [2022-02-20 14:01:20,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {2020#false} assume 0 != main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {2020#false} is VALID [2022-02-20 14:01:20,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {2020#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {2020#false} is VALID [2022-02-20 14:01:20,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {2020#false} main_~x~0#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {2020#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {2020#false} is VALID [2022-02-20 14:01:20,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {2020#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {2020#false} is VALID [2022-02-20 14:01:20,426 INFO L272 TraceCheckUtils]: 27: Hoare triple {2020#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {2020#false} is VALID [2022-02-20 14:01:20,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {2020#false} ~cond := #in~cond; {2020#false} is VALID [2022-02-20 14:01:20,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {2020#false} assume 0 == ~cond; {2020#false} is VALID [2022-02-20 14:01:20,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {2020#false} assume !false; {2020#false} is VALID [2022-02-20 14:01:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:01:20,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:01:20,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {2020#false} assume !false; {2020#false} is VALID [2022-02-20 14:01:20,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {2020#false} assume 0 == ~cond; {2020#false} is VALID [2022-02-20 14:01:20,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {2020#false} ~cond := #in~cond; {2020#false} is VALID [2022-02-20 14:01:20,584 INFO L272 TraceCheckUtils]: 27: Hoare triple {2020#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {2020#false} is VALID [2022-02-20 14:01:20,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {2020#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {2020#false} is VALID [2022-02-20 14:01:20,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {2020#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {2020#false} is VALID [2022-02-20 14:01:20,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {2020#false} main_~x~0#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {2020#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {2020#false} is VALID [2022-02-20 14:01:20,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {2020#false} assume 0 != main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {2020#false} is VALID [2022-02-20 14:01:20,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {2020#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {2020#false} is VALID [2022-02-20 14:01:20,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {2020#false} elem_exists_#res#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {2020#false} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {2020#false} is VALID [2022-02-20 14:01:20,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {2020#false} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {2020#false} main_~v~0#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {2020#false} assume !(main_~v~0#1 < 100000); {2020#false} is VALID [2022-02-20 14:01:20,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {2020#false} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2020#false} is VALID [2022-02-20 14:01:20,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {2020#false} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {2020#false} is VALID [2022-02-20 14:01:20,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {2020#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {2020#false} assume !(main_~x~0#1 < main_~n~0#1); {2020#false} is VALID [2022-02-20 14:01:20,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {2020#false} main_~x~0#1 := 0; {2020#false} is VALID [2022-02-20 14:01:20,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {2181#(< |ULTIMATE.start_main_~x~0#1| 100000)} assume !(main_~x~0#1 < 100000); {2020#false} is VALID [2022-02-20 14:01:20,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {2185#(< |ULTIMATE.start_main_~x~0#1| 99999)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2181#(< |ULTIMATE.start_main_~x~0#1| 100000)} is VALID [2022-02-20 14:01:20,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {2185#(< |ULTIMATE.start_main_~x~0#1| 99999)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2185#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-20 14:01:20,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {2192#(< |ULTIMATE.start_main_~x~0#1| 99998)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2185#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-20 14:01:20,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {2192#(< |ULTIMATE.start_main_~x~0#1| 99998)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2192#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-20 14:01:20,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {2199#(< |ULTIMATE.start_main_~x~0#1| 99997)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2192#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-20 14:01:20,590 INFO L290 TraceCheckUtils]: 4: Hoare triple {2199#(< |ULTIMATE.start_main_~x~0#1| 99997)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2199#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-20 14:01:20,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {2206#(< |ULTIMATE.start_main_~x~0#1| 99996)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2199#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-20 14:01:20,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {2206#(< |ULTIMATE.start_main_~x~0#1| 99996)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2206#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-20 14:01:20,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {2019#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {2206#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-20 14:01:20,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {2019#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {2019#true} is VALID [2022-02-20 14:01:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:01:20,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754743425] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:01:20,592 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:01:20,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2022-02-20 14:01:20,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808545280] [2022-02-20 14:01:20,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:01:20,593 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 14:01:20,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:20,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:20,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:20,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 14:01:20,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:20,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 14:01:20,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:01:20,632 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:23,195 INFO L93 Difference]: Finished difference Result 623 states and 861 transitions. [2022-02-20 14:01:23,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-20 14:01:23,196 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 14:01:23,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 818 transitions. [2022-02-20 14:01:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 818 transitions. [2022-02-20 14:01:23,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 818 transitions. [2022-02-20 14:01:23,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 818 edges. 818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:23,897 INFO L225 Difference]: With dead ends: 623 [2022-02-20 14:01:23,897 INFO L226 Difference]: Without dead ends: 577 [2022-02-20 14:01:23,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=396, Invalid=726, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 14:01:23,899 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 1489 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:23,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1511 Valid, 398 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 14:01:23,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-02-20 14:01:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 88. [2022-02-20 14:01:23,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:23,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 577 states. Second operand has 88 states, 83 states have (on average 1.216867469879518) internal successors, (101), 83 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:23,946 INFO L74 IsIncluded]: Start isIncluded. First operand 577 states. Second operand has 88 states, 83 states have (on average 1.216867469879518) internal successors, (101), 83 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:23,946 INFO L87 Difference]: Start difference. First operand 577 states. Second operand has 88 states, 83 states have (on average 1.216867469879518) internal successors, (101), 83 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:23,984 INFO L93 Difference]: Finished difference Result 577 states and 785 transitions. [2022-02-20 14:01:23,984 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 785 transitions. [2022-02-20 14:01:23,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:23,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:23,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.216867469879518) internal successors, (101), 83 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 577 states. [2022-02-20 14:01:23,987 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.216867469879518) internal successors, (101), 83 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 577 states. [2022-02-20 14:01:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:24,015 INFO L93 Difference]: Finished difference Result 577 states and 785 transitions. [2022-02-20 14:01:24,016 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 785 transitions. [2022-02-20 14:01:24,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:24,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:24,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:24,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.216867469879518) internal successors, (101), 83 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-02-20 14:01:24,021 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 31 [2022-02-20 14:01:24,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:24,021 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-02-20 14:01:24,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-02-20 14:01:24,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 14:01:24,023 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:24,023 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:24,094 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-02-20 14:01:24,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:01:24,236 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:24,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:24,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1437829230, now seen corresponding path program 2 times [2022-02-20 14:01:24,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:24,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977411782] [2022-02-20 14:01:24,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:24,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:24,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {4425#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {4425#true} is VALID [2022-02-20 14:01:24,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {4425#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {4425#true} is VALID [2022-02-20 14:01:24,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {4425#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4425#true} is VALID [2022-02-20 14:01:24,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {4425#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4425#true} is VALID [2022-02-20 14:01:24,416 INFO L290 TraceCheckUtils]: 4: Hoare triple {4425#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4425#true} is VALID [2022-02-20 14:01:24,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {4425#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4425#true} is VALID [2022-02-20 14:01:24,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {4425#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4425#true} is VALID [2022-02-20 14:01:24,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {4425#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4425#true} is VALID [2022-02-20 14:01:24,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {4425#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4425#true} is VALID [2022-02-20 14:01:24,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {4425#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4425#true} is VALID [2022-02-20 14:01:24,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {4425#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4425#true} is VALID [2022-02-20 14:01:24,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {4425#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4425#true} is VALID [2022-02-20 14:01:24,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {4425#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4425#true} is VALID [2022-02-20 14:01:24,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {4425#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4425#true} is VALID [2022-02-20 14:01:24,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {4425#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4425#true} is VALID [2022-02-20 14:01:24,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {4425#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4425#true} is VALID [2022-02-20 14:01:24,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {4425#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4425#true} is VALID [2022-02-20 14:01:24,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {4425#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4425#true} is VALID [2022-02-20 14:01:24,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {4425#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4425#true} is VALID [2022-02-20 14:01:24,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {4425#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4425#true} is VALID [2022-02-20 14:01:24,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {4425#true} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {4425#true} is VALID [2022-02-20 14:01:24,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {4425#true} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4425#true} is VALID [2022-02-20 14:01:24,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {4425#true} assume !(main_~x~0#1 < 100000); {4425#true} is VALID [2022-02-20 14:01:24,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {4425#true} main_~x~0#1 := 0; {4425#true} is VALID [2022-02-20 14:01:24,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {4425#true} assume !(main_~x~0#1 < main_~n~0#1); {4425#true} is VALID [2022-02-20 14:01:24,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {4425#true} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {4425#true} is VALID [2022-02-20 14:01:24,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {4425#true} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {4425#true} is VALID [2022-02-20 14:01:24,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {4425#true} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4425#true} is VALID [2022-02-20 14:01:24,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {4425#true} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {4425#true} is VALID [2022-02-20 14:01:24,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {4425#true} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4425#true} is VALID [2022-02-20 14:01:24,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {4425#true} assume !(main_~v~0#1 < 100000); {4425#true} is VALID [2022-02-20 14:01:24,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {4425#true} main_~v~0#1 := 0; {4425#true} is VALID [2022-02-20 14:01:24,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {4425#true} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {4425#true} is VALID [2022-02-20 14:01:24,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {4425#true} assume !(elem_exists_~i~0#1 < elem_exists_~size#1); {4425#true} is VALID [2022-02-20 14:01:24,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {4425#true} elem_exists_#res#1 := 0; {4427#(= 0 |ULTIMATE.start_elem_exists_#res#1|)} is VALID [2022-02-20 14:01:24,423 INFO L290 TraceCheckUtils]: 35: Hoare triple {4427#(= 0 |ULTIMATE.start_elem_exists_#res#1|)} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {4428#(= |ULTIMATE.start_main_#t~ret13#1| 0)} is VALID [2022-02-20 14:01:24,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {4428#(= |ULTIMATE.start_main_#t~ret13#1| 0)} assume 0 != main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {4426#false} is VALID [2022-02-20 14:01:24,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {4426#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {4426#false} is VALID [2022-02-20 14:01:24,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {4426#false} main_~x~0#1 := 0; {4426#false} is VALID [2022-02-20 14:01:24,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {4426#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {4426#false} is VALID [2022-02-20 14:01:24,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {4426#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {4426#false} is VALID [2022-02-20 14:01:24,425 INFO L272 TraceCheckUtils]: 41: Hoare triple {4426#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {4426#false} is VALID [2022-02-20 14:01:24,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {4426#false} ~cond := #in~cond; {4426#false} is VALID [2022-02-20 14:01:24,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {4426#false} assume 0 == ~cond; {4426#false} is VALID [2022-02-20 14:01:24,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {4426#false} assume !false; {4426#false} is VALID [2022-02-20 14:01:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-02-20 14:01:24,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:24,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977411782] [2022-02-20 14:01:24,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977411782] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:01:24,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:01:24,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:01:24,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659703173] [2022-02-20 14:01:24,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:01:24,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-20 14:01:24,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:24,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:24,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:24,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:01:24,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:24,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:01:24,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:01:24,449 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:24,622 INFO L93 Difference]: Finished difference Result 153 states and 192 transitions. [2022-02-20 14:01:24,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:01:24,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-20 14:01:24,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:24,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-02-20 14:01:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-02-20 14:01:24,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-02-20 14:01:24,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:24,713 INFO L225 Difference]: With dead ends: 153 [2022-02-20 14:01:24,714 INFO L226 Difference]: Without dead ends: 114 [2022-02-20 14:01:24,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:01:24,715 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 18 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:24,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 173 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:01:24,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-02-20 14:01:24,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2022-02-20 14:01:24,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:24,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 91 states, 86 states have (on average 1.2093023255813953) internal successors, (104), 86 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:24,782 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 91 states, 86 states have (on average 1.2093023255813953) internal successors, (104), 86 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:24,782 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 91 states, 86 states have (on average 1.2093023255813953) internal successors, (104), 86 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:24,785 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2022-02-20 14:01:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2022-02-20 14:01:24,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:24,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:24,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.2093023255813953) internal successors, (104), 86 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 114 states. [2022-02-20 14:01:24,787 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.2093023255813953) internal successors, (104), 86 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 114 states. [2022-02-20 14:01:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:24,790 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2022-02-20 14:01:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2022-02-20 14:01:24,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:24,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:24,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:24,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.2093023255813953) internal successors, (104), 86 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:01:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2022-02-20 14:01:24,793 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 45 [2022-02-20 14:01:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:24,794 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2022-02-20 14:01:24,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2022-02-20 14:01:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 14:01:24,795 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:24,795 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:24,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 14:01:24,795 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:24,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:24,796 INFO L85 PathProgramCache]: Analyzing trace with hash 311045192, now seen corresponding path program 1 times [2022-02-20 14:01:24,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:24,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865316510] [2022-02-20 14:01:24,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:24,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:24,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {5011#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {5011#true} is VALID [2022-02-20 14:01:24,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {5011#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,893 INFO L290 TraceCheckUtils]: 4: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !(main_~x~0#1 < 100000); {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} main_~x~0#1 := 0; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !(main_~x~0#1 < main_~n~0#1); {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,917 INFO L290 TraceCheckUtils]: 28: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~v~0#1 < 100000);assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,917 INFO L290 TraceCheckUtils]: 29: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !(main_~v~0#1 < 100000); {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} main_~v~0#1 := 0; {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 14:01:24,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {5013#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~v~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset, elem_exists_#in~size#1, elem_exists_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem12#1;havoc elem_exists_#res#1;havoc elem_exists_#t~mem2#1, elem_exists_#t~post1#1, elem_exists_~set#1.base, elem_exists_~set#1.offset, elem_exists_~size#1, elem_exists_~value#1, elem_exists_~i~0#1;elem_exists_~set#1.base, elem_exists_~set#1.offset := elem_exists_#in~set#1.base, elem_exists_#in~set#1.offset;elem_exists_~size#1 := elem_exists_#in~size#1;elem_exists_~value#1 := elem_exists_#in~value#1;havoc elem_exists_~i~0#1;elem_exists_~i~0#1 := 0; {5014#(and (= |ULTIMATE.start_elem_exists_~size#1| 0) (= |ULTIMATE.start_elem_exists_~i~0#1| 0))} is VALID [2022-02-20 14:01:24,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {5014#(and (= |ULTIMATE.start_elem_exists_~size#1| 0) (= |ULTIMATE.start_elem_exists_~i~0#1| 0))} assume !!(elem_exists_~i~0#1 < elem_exists_~size#1);call elem_exists_#t~mem2#1 := read~int(elem_exists_~set#1.base, elem_exists_~set#1.offset + 4 * elem_exists_~i~0#1, 4); {5012#false} is VALID [2022-02-20 14:01:24,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {5012#false} assume elem_exists_#t~mem2#1 == elem_exists_~value#1;havoc elem_exists_#t~mem2#1;elem_exists_#res#1 := 1; {5012#false} is VALID [2022-02-20 14:01:24,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {5012#false} main_#t~ret13#1 := elem_exists_#res#1;assume { :end_inline_elem_exists } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647; {5012#false} is VALID [2022-02-20 14:01:24,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {5012#false} assume 0 != main_#t~ret13#1;havoc main_#t~mem12#1;havoc main_#t~ret13#1;call main_#t~mem14#1 := read~int(main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);assume { :begin_inline_insert } true;insert_#in~set#1.base, insert_#in~set#1.offset, insert_#in~size#1, insert_#in~value#1 := main_~#set~0#1.base, main_~#set~0#1.offset, main_~n~0#1, main_#t~mem14#1;havoc insert_#res#1;havoc insert_~set#1.base, insert_~set#1.offset, insert_~size#1, insert_~value#1;insert_~set#1.base, insert_~set#1.offset := insert_#in~set#1.base, insert_#in~set#1.offset;insert_~size#1 := insert_#in~size#1;insert_~value#1 := insert_#in~value#1;call write~int(insert_~value#1, insert_~set#1.base, insert_~set#1.offset + 4 * insert_~size#1, 4);insert_#res#1 := 1 + insert_~size#1; {5012#false} is VALID [2022-02-20 14:01:24,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {5012#false} main_#t~ret15#1 := insert_#res#1;assume { :end_inline_insert } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647;main_~n~0#1 := main_#t~ret15#1;havoc main_#t~mem14#1;havoc main_#t~ret15#1; {5012#false} is VALID [2022-02-20 14:01:24,922 INFO L290 TraceCheckUtils]: 38: Hoare triple {5012#false} main_~x~0#1 := 0; {5012#false} is VALID [2022-02-20 14:01:24,922 INFO L290 TraceCheckUtils]: 39: Hoare triple {5012#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {5012#false} is VALID [2022-02-20 14:01:24,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {5012#false} assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem19#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4); {5012#false} is VALID [2022-02-20 14:01:24,923 INFO L272 TraceCheckUtils]: 41: Hoare triple {5012#false} call __VERIFIER_assert((if main_#t~mem18#1 != main_#t~mem19#1 then 1 else 0)); {5012#false} is VALID [2022-02-20 14:01:24,923 INFO L290 TraceCheckUtils]: 42: Hoare triple {5012#false} ~cond := #in~cond; {5012#false} is VALID [2022-02-20 14:01:24,923 INFO L290 TraceCheckUtils]: 43: Hoare triple {5012#false} assume 0 == ~cond; {5012#false} is VALID [2022-02-20 14:01:24,923 INFO L290 TraceCheckUtils]: 44: Hoare triple {5012#false} assume !false; {5012#false} is VALID [2022-02-20 14:01:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-02-20 14:01:24,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:24,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865316510] [2022-02-20 14:01:24,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865316510] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:01:24,926 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:01:24,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:01:24,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189129024] [2022-02-20 14:01:24,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:01:24,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-20 14:01:24,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:24,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:24,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:24,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:01:24,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:24,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:01:24,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:01:24,952 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:25,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:25,001 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2022-02-20 14:01:25,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:01:25,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-20 14:01:25,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-02-20 14:01:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:25,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-02-20 14:01:25,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2022-02-20 14:01:25,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:25,045 INFO L225 Difference]: With dead ends: 100 [2022-02-20 14:01:25,045 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 14:01:25,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:01:25,046 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:25,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 28 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:01:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 14:01:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 14:01:25,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:25,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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-02-20 14:01:25,048 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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-02-20 14:01:25,048 INFO L87 Difference]: Start difference. First operand 0 states. Second 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-02-20 14:01:25,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:25,048 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:01:25,049 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:01:25,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:25,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:25,049 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-02-20 14:01:25,049 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-02-20 14:01:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:25,049 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:01:25,049 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:01:25,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:25,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:25,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:25,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:25,050 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-02-20 14:01:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 14:01:25,050 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-02-20 14:01:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:25,051 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 14:01:25,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:01:25,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:25,054 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:01:25,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 14:01:25,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 14:01:25,346 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 54) no Hoare annotation was computed. [2022-02-20 14:01:25,347 INFO L858 garLoopResultBuilder]: For program point L52-2(lines 52 54) no Hoare annotation was computed. [2022-02-20 14:01:25,347 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 14:01:25,347 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 14:01:25,347 INFO L858 garLoopResultBuilder]: For program point L61-2(lines 61 65) no Hoare annotation was computed. [2022-02-20 14:01:25,347 INFO L854 garLoopResultBuilder]: At program point L61-3(lines 61 65) the Hoare annotation is: (and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) [2022-02-20 14:01:25,347 INFO L858 garLoopResultBuilder]: For program point L61-4(lines 61 65) no Hoare annotation was computed. [2022-02-20 14:01:25,347 INFO L858 garLoopResultBuilder]: For program point L62-2(lines 62 64) no Hoare annotation was computed. [2022-02-20 14:01:25,347 INFO L854 garLoopResultBuilder]: At program point L62-3(lines 62 64) the Hoare annotation is: false [2022-02-20 14:01:25,347 INFO L854 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: false [2022-02-20 14:01:25,347 INFO L858 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2022-02-20 14:01:25,347 INFO L858 garLoopResultBuilder]: For program point L55-2(lines 55 59) no Hoare annotation was computed. [2022-02-20 14:01:25,347 INFO L858 garLoopResultBuilder]: For program point L22-2(lines 22 24) no Hoare annotation was computed. [2022-02-20 14:01:25,348 INFO L854 garLoopResultBuilder]: At program point L55-3(lines 55 59) the Hoare annotation is: (and (= |ULTIMATE.start_elem_exists_~size#1| 0) (= |ULTIMATE.start_elem_exists_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) [2022-02-20 14:01:25,348 INFO L854 garLoopResultBuilder]: At program point L22-3(lines 22 24) the Hoare annotation is: (and (= |ULTIMATE.start_elem_exists_~size#1| 0) (= |ULTIMATE.start_elem_exists_~i~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) [2022-02-20 14:01:25,348 INFO L858 garLoopResultBuilder]: For program point L22-4(lines 22 24) no Hoare annotation was computed. [2022-02-20 14:01:25,348 INFO L858 garLoopResultBuilder]: For program point L47-2(lines 47 50) no Hoare annotation was computed. [2022-02-20 14:01:25,348 INFO L854 garLoopResultBuilder]: At program point L47-3(lines 47 50) the Hoare annotation is: (and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) [2022-02-20 14:01:25,348 INFO L858 garLoopResultBuilder]: For program point L47-4(lines 47 50) no Hoare annotation was computed. [2022-02-20 14:01:25,348 INFO L858 garLoopResultBuilder]: For program point L39-2(lines 39 43) no Hoare annotation was computed. [2022-02-20 14:01:25,348 INFO L854 garLoopResultBuilder]: At program point L39-3(lines 39 43) the Hoare annotation is: (and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) [2022-02-20 14:01:25,348 INFO L858 garLoopResultBuilder]: For program point L39-4(lines 39 43) no Hoare annotation was computed. [2022-02-20 14:01:25,348 INFO L858 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-02-20 14:01:25,348 INFO L858 garLoopResultBuilder]: For program point L56-2(lines 56 58) no Hoare annotation was computed. [2022-02-20 14:01:25,348 INFO L854 garLoopResultBuilder]: At program point L56-3(lines 56 58) the Hoare annotation is: false [2022-02-20 14:01:25,348 INFO L858 garLoopResultBuilder]: For program point L40-2(lines 40 42) no Hoare annotation was computed. [2022-02-20 14:01:25,348 INFO L854 garLoopResultBuilder]: At program point L40-3(lines 40 42) the Hoare annotation is: false [2022-02-20 14:01:25,348 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 14:01:25,349 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: false [2022-02-20 14:01:25,349 INFO L858 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2022-02-20 14:01:25,349 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: false [2022-02-20 14:01:25,349 INFO L858 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-02-20 14:01:25,349 INFO L861 garLoopResultBuilder]: At program point L66(lines 27 67) the Hoare annotation is: true [2022-02-20 14:01:25,350 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 14:01:25,350 INFO L858 garLoopResultBuilder]: For program point L33-2(lines 33 36) no Hoare annotation was computed. [2022-02-20 14:01:25,350 INFO L854 garLoopResultBuilder]: At program point L33-3(lines 33 36) the Hoare annotation is: (= |ULTIMATE.start_main_~n~0#1| 0) [2022-02-20 14:01:25,350 INFO L858 garLoopResultBuilder]: For program point L33-4(lines 33 36) no Hoare annotation was computed. [2022-02-20 14:01:25,350 INFO L854 garLoopResultBuilder]: At program point L25(lines 20 26) the Hoare annotation is: (and (= |ULTIMATE.start_elem_exists_~size#1| 0) (= |ULTIMATE.start_elem_exists_~i~0#1| 0) (= 0 |ULTIMATE.start_elem_exists_#res#1|) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) [2022-02-20 14:01:25,350 INFO L854 garLoopResultBuilder]: At program point L18(lines 16 19) the Hoare annotation is: false [2022-02-20 14:01:25,350 INFO L858 garLoopResultBuilder]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2022-02-20 14:01:25,351 INFO L854 garLoopResultBuilder]: At program point L51-3(lines 51 60) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse1 (= |ULTIMATE.start_main_~x~0#1| 0))) (or (and (= |ULTIMATE.start_elem_exists_~size#1| 0) (= |ULTIMATE.start_elem_exists_~i~0#1| 0) .cse0 .cse1) (and .cse0 (= |ULTIMATE.start_main_~v~0#1| 0) .cse1))) [2022-02-20 14:01:25,351 INFO L858 garLoopResultBuilder]: For program point L51-4(lines 51 60) no Hoare annotation was computed. [2022-02-20 14:01:25,351 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(line 13) the Hoare annotation is: true [2022-02-20 14:01:25,351 INFO L858 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-02-20 14:01:25,351 INFO L858 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2022-02-20 14:01:25,351 INFO L858 garLoopResultBuilder]: For program point L13-3(line 13) no Hoare annotation was computed. [2022-02-20 14:01:25,351 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 13) no Hoare annotation was computed. [2022-02-20 14:01:25,352 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-02-20 14:01:25,439 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2022-02-20 14:01:25,440 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:01:25,444 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:01:25,444 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 14:01:25,444 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:01:25,444 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 14:01:25,444 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 14:01:25,444 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-02-20 14:01:25,444 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-02-20 14:01:25,444 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-02-20 14:01:25,444 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-02-20 14:01:25,445 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-02-20 14:01:25,445 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2022-02-20 14:01:25,445 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-02-20 14:01:25,445 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-02-20 14:01:25,445 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 14:01:25,445 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 14:01:25,445 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 14:01:25,445 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2022-02-20 14:01:25,445 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2022-02-20 14:01:25,446 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-02-20 14:01:25,446 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 14:01:25,446 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2022-02-20 14:01:25,446 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2022-02-20 14:01:25,447 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 14:01:25,447 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 14:01:25,447 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 14:01:25,447 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2022-02-20 14:01:25,447 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2022-02-20 14:01:25,447 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2022-02-20 14:01:25,447 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2022-02-20 14:01:25,447 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-02-20 14:01:25,447 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 14:01:25,447 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-02-20 14:01:25,448 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 14:01:25,448 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 14:01:25,448 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 14:01:25,448 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 14:01:25,448 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2022-02-20 14:01:25,448 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-02-20 14:01:25,448 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 14:01:25,448 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 14:01:25,448 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 14:01:25,449 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2022-02-20 14:01:25,449 WARN L170 areAnnotationChecker]: L51-4 has no Hoare annotation [2022-02-20 14:01:25,449 WARN L170 areAnnotationChecker]: L51-4 has no Hoare annotation [2022-02-20 14:01:25,450 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2022-02-20 14:01:25,450 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2022-02-20 14:01:25,450 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 14:01:25,451 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 14:01:25,451 WARN L170 areAnnotationChecker]: L51-4 has no Hoare annotation [2022-02-20 14:01:25,451 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2022-02-20 14:01:25,451 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2022-02-20 14:01:25,451 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 14:01:25,451 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2022-02-20 14:01:25,452 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 14:01:25,452 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2022-02-20 14:01:25,452 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 14:01:25,452 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 14:01:25,452 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:01:25,452 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 14:01:25,452 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 14:01:25,452 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:01:25,452 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 14:01:25,453 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 14:01:25,453 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 14:01:25,453 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 14:01:25,453 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 14:01:25,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:01:25 BoogieIcfgContainer [2022-02-20 14:01:25,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:01:25,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:01:25,548 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:01:25,548 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:01:25,548 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:01:16" (3/4) ... [2022-02-20 14:01:25,551 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 14:01:25,605 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 14:01:25,839 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-02-20 14:01:25,841 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-02-20 14:01:25,844 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 14:01:25,844 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 14:01:26,889 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((size == 0 && i == 0) && 0 == \result) && n == 0) && x == 0 [2022-02-20 14:01:26,923 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:01:26,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:01:26,924 INFO L158 Benchmark]: Toolchain (without parser) took 10902.96ms. Allocated memory was 88.1MB in the beginning and 176.2MB in the end (delta: 88.1MB). Free memory was 56.0MB in the beginning and 139.9MB in the end (delta: -83.9MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2022-02-20 14:01:26,924 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 88.1MB. Free memory was 43.4MB in the beginning and 43.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:01:26,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.84ms. Allocated memory was 88.1MB in the beginning and 121.6MB in the end (delta: 33.6MB). Free memory was 55.7MB in the beginning and 96.1MB in the end (delta: -40.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 14:01:26,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.06ms. Allocated memory is still 121.6MB. Free memory was 96.1MB in the beginning and 93.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:01:26,925 INFO L158 Benchmark]: Boogie Preprocessor took 60.85ms. Allocated memory is still 121.6MB. Free memory was 93.6MB in the beginning and 92.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:01:26,925 INFO L158 Benchmark]: RCFGBuilder took 482.58ms. Allocated memory is still 121.6MB. Free memory was 92.0MB in the beginning and 75.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 14:01:26,926 INFO L158 Benchmark]: TraceAbstraction took 8570.08ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 75.5MB in the beginning and 143.0MB in the end (delta: -67.5MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2022-02-20 14:01:26,926 INFO L158 Benchmark]: Witness Printer took 1375.61ms. Allocated memory is still 176.2MB. Free memory was 143.0MB in the beginning and 139.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:01:26,927 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 88.1MB. Free memory was 43.4MB in the beginning and 43.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.84ms. Allocated memory was 88.1MB in the beginning and 121.6MB in the end (delta: 33.6MB). Free memory was 55.7MB in the beginning and 96.1MB in the end (delta: -40.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.06ms. Allocated memory is still 121.6MB. Free memory was 96.1MB in the beginning and 93.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.85ms. Allocated memory is still 121.6MB. Free memory was 93.6MB in the beginning and 92.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 482.58ms. Allocated memory is still 121.6MB. Free memory was 92.0MB in the beginning and 75.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8570.08ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 75.5MB in the beginning and 143.0MB in the end (delta: -67.5MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. * Witness Printer took 1375.61ms. Allocated memory is still 176.2MB. Free memory was 143.0MB in the beginning and 139.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1824 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1784 mSDsluCounter, 1125 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 763 mSDsCounter, 510 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 435 IncrementalHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 510 mSolverCounterUnsat, 362 mSDtfsCounter, 435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=6, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 699 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 35 PreInvPairs, 58 NumberOfFragments, 99 HoareAnnotationTreeSize, 35 FomulaSimplifications, 92 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 438 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 265 ConstructedInterpolants, 0 QuantifiedInterpolants, 427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 245 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 258/294 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: 39]: Loop Invariant Derived loop invariant: n == 0 && x == 0 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((size == 0 && i == 0) && n == 0) && x == 0 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: (((size == 0 && i == 0) && n == 0) && x == 0) || ((n == 0 && v == 0) && x == 0) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((size == 0 && i == 0) && 0 == \result) && n == 0) && x == 0 - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: n == 0 && x == 0 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: n == 0 && x == 0 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((size == 0 && i == 0) && n == 0) && x == 0 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: n == 0 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 14:01:26,968 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