./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/sum_by_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/sum_by_3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cbdeb806056afbf44cc985ff91f53f00e848d18cfefb92d1f6744eb19cf6d91b --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 04:11:01,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 04:11:01,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 04:11:01,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 04:11:01,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 04:11:01,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 04:11:01,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 04:11:01,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 04:11:01,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 04:11:01,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 04:11:01,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 04:11:01,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 04:11:01,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 04:11:01,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 04:11:01,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 04:11:01,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 04:11:01,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 04:11:01,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 04:11:01,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 04:11:01,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 04:11:01,703 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 04:11:01,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 04:11:01,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 04:11:01,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 04:11:01,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 04:11:01,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 04:11:01,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 04:11:01,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 04:11:01,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 04:11:01,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 04:11:01,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 04:11:01,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 04:11:01,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 04:11:01,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 04:11:01,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 04:11:01,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 04:11:01,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 04:11:01,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 04:11:01,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 04:11:01,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 04:11:01,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 04:11:01,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 04:11:01,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 04:11:01,734 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 04:11:01,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 04:11:01,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 04:11:01,735 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 04:11:01,735 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 04:11:01,735 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 04:11:01,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 04:11:01,736 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 04:11:01,737 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 04:11:01,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 04:11:01,737 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 04:11:01,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 04:11:01,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 04:11:01,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 04:11:01,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 04:11:01,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 04:11:01,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 04:11:01,739 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 04:11:01,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 04:11:01,739 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 04:11:01,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 04:11:01,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 04:11:01,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 04:11:01,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 04:11:01,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:11:01,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 04:11:01,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 04:11:01,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 04:11:01,741 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 04:11:01,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 04:11:01,742 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 04:11:01,742 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 04:11:01,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 04:11:01,742 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 -> cbdeb806056afbf44cc985ff91f53f00e848d18cfefb92d1f6744eb19cf6d91b [2022-07-12 04:11:01,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 04:11:01,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 04:11:01,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 04:11:01,968 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 04:11:01,969 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 04:11:01,970 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/sum_by_3.c [2022-07-12 04:11:02,031 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c783b3a2/288a21354519433bb129e20394525b1f/FLAG099d93787 [2022-07-12 04:11:02,421 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 04:11:02,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sum_by_3.c [2022-07-12 04:11:02,427 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c783b3a2/288a21354519433bb129e20394525b1f/FLAG099d93787 [2022-07-12 04:11:02,841 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c783b3a2/288a21354519433bb129e20394525b1f [2022-07-12 04:11:02,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 04:11:02,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 04:11:02,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 04:11:02,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 04:11:02,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 04:11:02,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:11:02" (1/1) ... [2022-07-12 04:11:02,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4546b05c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:11:02, skipping insertion in model container [2022-07-12 04:11:02,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:11:02" (1/1) ... [2022-07-12 04:11:02,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 04:11:02,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 04:11:03,006 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/loops-crafted-1/sum_by_3.c[406,419] [2022-07-12 04:11:03,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:11:03,023 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 04:11:03,034 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/loops-crafted-1/sum_by_3.c[406,419] [2022-07-12 04:11:03,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:11:03,047 INFO L208 MainTranslator]: Completed translation [2022-07-12 04:11:03,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:11:03 WrapperNode [2022-07-12 04:11:03,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 04:11:03,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 04:11:03,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 04:11:03,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 04:11:03,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:11:03" (1/1) ... [2022-07-12 04:11:03,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:11:03" (1/1) ... [2022-07-12 04:11:03,077 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2022-07-12 04:11:03,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 04:11:03,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 04:11:03,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 04:11:03,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 04:11:03,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:11:03" (1/1) ... [2022-07-12 04:11:03,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:11:03" (1/1) ... [2022-07-12 04:11:03,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:11:03" (1/1) ... [2022-07-12 04:11:03,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:11:03" (1/1) ... [2022-07-12 04:11:03,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:11:03" (1/1) ... [2022-07-12 04:11:03,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:11:03" (1/1) ... [2022-07-12 04:11:03,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:11:03" (1/1) ... [2022-07-12 04:11:03,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 04:11:03,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 04:11:03,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 04:11:03,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 04:11:03,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:11:03" (1/1) ... [2022-07-12 04:11:03,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:11:03,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:11:03,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 04:11:03,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 04:11:03,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 04:11:03,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 04:11:03,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 04:11:03,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 04:11:03,196 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 04:11:03,197 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 04:11:03,280 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 04:11:03,285 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 04:11:03,285 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 04:11:03,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:11:03 BoogieIcfgContainer [2022-07-12 04:11:03,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 04:11:03,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 04:11:03,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 04:11:03,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 04:11:03,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:11:02" (1/3) ... [2022-07-12 04:11:03,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dcb81d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:11:03, skipping insertion in model container [2022-07-12 04:11:03,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:11:03" (2/3) ... [2022-07-12 04:11:03,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dcb81d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:11:03, skipping insertion in model container [2022-07-12 04:11:03,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:11:03" (3/3) ... [2022-07-12 04:11:03,300 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_by_3.c [2022-07-12 04:11:03,314 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 04:11:03,314 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 04:11:03,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 04:11:03,364 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6664f23c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@252a3fec [2022-07-12 04:11:03,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 04:11:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 04:11:03,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:11:03,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:11:03,389 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:11:03,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:11:03,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1645470860, now seen corresponding path program 1 times [2022-07-12 04:11:03,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:11:03,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620093995] [2022-07-12 04:11:03,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:03,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:11:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:11:03,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:11:03,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620093995] [2022-07-12 04:11:03,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620093995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:11:03,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:11:03,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 04:11:03,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654582364] [2022-07-12 04:11:03,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:11:03,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 04:11:03,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:11:03,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 04:11:03,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 04:11:03,587 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:11:03,602 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-07-12 04:11:03,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 04:11:03,604 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 04:11:03,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:11:03,611 INFO L225 Difference]: With dead ends: 28 [2022-07-12 04:11:03,611 INFO L226 Difference]: Without dead ends: 12 [2022-07-12 04:11:03,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 04:11:03,617 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:11:03,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:11:03,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-07-12 04:11:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-07-12 04:11:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2022-07-12 04:11:03,662 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 11 [2022-07-12 04:11:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:11:03,662 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-07-12 04:11:03,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-07-12 04:11:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 04:11:03,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:11:03,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:11:03,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 04:11:03,664 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:11:03,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:11:03,665 INFO L85 PathProgramCache]: Analyzing trace with hash -26777608, now seen corresponding path program 1 times [2022-07-12 04:11:03,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:11:03,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241539789] [2022-07-12 04:11:03,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:03,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:11:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:11:04,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:11:04,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241539789] [2022-07-12 04:11:04,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241539789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:11:04,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:11:04,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 04:11:04,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655295026] [2022-07-12 04:11:04,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:11:04,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 04:11:04,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:11:04,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 04:11:04,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 04:11:04,336 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:04,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:11:04,531 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-07-12 04:11:04,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 04:11:04,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 04:11:04,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:11:04,533 INFO L225 Difference]: With dead ends: 33 [2022-07-12 04:11:04,533 INFO L226 Difference]: Without dead ends: 29 [2022-07-12 04:11:04,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-12 04:11:04,538 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:11:04,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 27 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:11:04,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-12 04:11:04,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 17. [2022-07-12 04:11:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-07-12 04:11:04,549 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2022-07-12 04:11:04,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:11:04,550 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-07-12 04:11:04,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:04,551 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-07-12 04:11:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 04:11:04,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:11:04,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:11:04,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 04:11:04,555 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:11:04,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:11:04,556 INFO L85 PathProgramCache]: Analyzing trace with hash 182012736, now seen corresponding path program 1 times [2022-07-12 04:11:04,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:11:04,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725996971] [2022-07-12 04:11:04,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:04,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:11:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:11:05,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:11:05,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725996971] [2022-07-12 04:11:05,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725996971] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:11:05,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865038196] [2022-07-12 04:11:05,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:11:05,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:11:05,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:11:05,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:11:05,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 04:11:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:11:05,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 04:11:05,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:11:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:11:06,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:11:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:11:44,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865038196] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:11:44,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:11:44,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-07-12 04:11:44,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058217844] [2022-07-12 04:11:44,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:11:44,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 04:11:44,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:11:44,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 04:11:44,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=278, Unknown=14, NotChecked=0, Total=380 [2022-07-12 04:11:44,381 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:11:46,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 04:11:48,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:11:50,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:12:03,564 WARN L233 SmtUtils]: Spent 12.74s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 04:12:09,907 WARN L233 SmtUtils]: Spent 6.31s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 04:12:11,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:12:16,232 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:12:50,176 WARN L233 SmtUtils]: Spent 23.18s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 04:12:58,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:13:09,320 WARN L233 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 04:13:11,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:13:13,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:13:15,593 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:13:17,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:13:19,940 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:13:22,138 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:13:24,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:13:26,395 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:13:28,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:13:30,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:13:32,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:13:34,983 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse0 (mod c_~SIZE~0 4294967296))) (and (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| (* |c_ULTIMATE.start_main_~j~0#1| 2)) 4294967296) 3) 4294967296) .cse0) (<= c_~SIZE~0 20000001) (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~j~0#1| |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~k~0#1|) 4294967296) 3) 4294967296) .cse0) (<= (mod (div (mod (+ (* .cse1 2) |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 3) 4294967296) .cse0) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse2 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (or (not (< .cse1 .cse2)) (<= (mod (div (mod (+ (* .cse3 2) |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 3) 4294967296) .cse0) (< .cse3 .cse2))) (<= 20000001 c_~SIZE~0))) is different from false [2022-07-12 04:13:37,100 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse0 (mod c_~SIZE~0 4294967296))) (and (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| (* |c_ULTIMATE.start_main_~j~0#1| 2)) 4294967296) 3) 4294967296) .cse0) (<= c_~SIZE~0 20000001) (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~j~0#1| |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~k~0#1|) 4294967296) 3) 4294967296) .cse0) (<= (mod (div (mod (+ (* .cse1 2) |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 3) 4294967296) .cse0) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse2 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (or (not (< .cse1 .cse2)) (<= (mod (div (mod (+ (* .cse3 2) |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 3) 4294967296) .cse0) (< .cse3 .cse2))) (<= 20000001 c_~SIZE~0))) is different from true [2022-07-12 04:13:39,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:13:41,326 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~SIZE~0 4294967296)) (.cse0 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (and (<= .cse0 .cse1) (= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) |c_ULTIMATE.start_main_~j~0#1|) (<= c_~SIZE~0 20000001) (<= (mod (div (mod (+ |c_ULTIMATE.start_main_~j~0#1| |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~k~0#1|) 4294967296) 3) 4294967296) .cse1) (< 0 .cse0) (<= 20000001 c_~SIZE~0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-12 04:13:49,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:13:54,171 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:13:56,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:02,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:05,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:07,304 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse1 (mod c_~SIZE~0 4294967296))) (and (<= (mod (div (mod (+ (* .cse0 2) |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 3) 4294967296) .cse1) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse2 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (or (not (< .cse0 .cse2)) (<= (mod (div (mod (+ (* .cse3 2) |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 3) 4294967296) .cse1) (< .cse3 .cse2))))) is different from true [2022-07-12 04:14:09,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:11,488 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:13,660 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:15,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:20,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:22,410 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:24,551 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:26,742 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:28,915 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:33,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:35,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:37,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:39,893 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:14:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:14:39,894 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2022-07-12 04:14:40,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 04:14:40,079 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 04:14:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:14:40,081 INFO L225 Difference]: With dead ends: 72 [2022-07-12 04:14:40,081 INFO L226 Difference]: Without dead ends: 64 [2022-07-12 04:14:40,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 133.0s TimeCoverageRelationStatistics Valid=310, Invalid=797, Unknown=27, NotChecked=198, Total=1332 [2022-07-12 04:14:40,082 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 172 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 77.3s IncrementalHoareTripleChecker+Time [2022-07-12 04:14:40,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 81 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 36 Unknown, 38 Unchecked, 77.3s Time] [2022-07-12 04:14:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-12 04:14:40,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 24. [2022-07-12 04:14:40,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:14:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-07-12 04:14:40,096 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 12 [2022-07-12 04:14:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:14:40,096 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-07-12 04:14:40,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:14:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-07-12 04:14:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 04:14:40,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:14:40,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:14:40,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 04:14:40,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:14:40,298 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:14:40,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:14:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash -828440446, now seen corresponding path program 1 times [2022-07-12 04:14:40,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:14:40,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959729532] [2022-07-12 04:14:40,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:14:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:14:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:14:40,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:14:40,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:14:40,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959729532] [2022-07-12 04:14:40,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959729532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:14:40,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:14:40,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 04:14:40,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333010077] [2022-07-12 04:14:40,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:14:40,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 04:14:40,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:14:40,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 04:14:40,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 04:14:40,401 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:14:40,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:14:40,445 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-07-12 04:14:40,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 04:14:40,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 04:14:40,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:14:40,446 INFO L225 Difference]: With dead ends: 35 [2022-07-12 04:14:40,447 INFO L226 Difference]: Without dead ends: 24 [2022-07-12 04:14:40,447 INFO L412 NwaCegarLoop]: 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-07-12 04:14:40,448 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:14:40,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 22 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:14:40,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-12 04:14:40,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-12 04:14:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:14:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-07-12 04:14:40,454 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 12 [2022-07-12 04:14:40,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:14:40,463 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-07-12 04:14:40,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:14:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-07-12 04:14:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 04:14:40,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:14:40,464 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:14:40,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 04:14:40,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:14:40,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:14:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash 133150594, now seen corresponding path program 1 times [2022-07-12 04:14:40,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:14:40,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391052750] [2022-07-12 04:14:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:14:40,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:14:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:14:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:14:40,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:14:40,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391052750] [2022-07-12 04:14:40,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391052750] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:14:40,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993810810] [2022-07-12 04:14:40,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:14:40,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:14:40,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:14:40,734 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:14:40,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 04:14:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:14:40,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 04:14:40,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:14:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 04:14:40,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 04:14:40,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993810810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:14:40,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 04:14:40,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-07-12 04:14:40,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667023960] [2022-07-12 04:14:40,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:14:40,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 04:14:40,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:14:40,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 04:14:40,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-12 04:14:40,810 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:14:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:14:40,868 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-07-12 04:14:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 04:14:40,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 04:14:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:14:40,869 INFO L225 Difference]: With dead ends: 30 [2022-07-12 04:14:40,869 INFO L226 Difference]: Without dead ends: 20 [2022-07-12 04:14:40,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-12 04:14:40,870 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:14:40,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 13 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:14:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-12 04:14:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-12 04:14:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:14:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-12 04:14:40,881 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2022-07-12 04:14:40,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:14:40,881 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-12 04:14:40,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:14:40,881 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-12 04:14:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 04:14:40,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:14:40,882 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:14:40,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 04:14:41,103 WARN L477 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-07-12 04:14:41,104 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:14:41,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:14:41,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1728071361, now seen corresponding path program 1 times [2022-07-12 04:14:41,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:14:41,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554055289] [2022-07-12 04:14:41,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:14:41,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:14:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:14:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:14:41,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:14:41,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554055289] [2022-07-12 04:14:41,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554055289] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:14:41,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4465129] [2022-07-12 04:14:41,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:14:41,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:14:41,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:14:41,284 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:14:41,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 04:14:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:14:41,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 04:14:41,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:14:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:14:41,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:15:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:15:10,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4465129] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:15:10,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:15:10,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 22 [2022-07-12 04:15:10,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143563448] [2022-07-12 04:15:10,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:15:10,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 04:15:10,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:15:10,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 04:15:10,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=366, Unknown=7, NotChecked=0, Total=462 [2022-07-12 04:15:10,358 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:15:12,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 04:15:14,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:15:16,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:15:18,962 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:15:21,329 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse0 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse6 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse2 (not (< .cse0 .cse6))) (.cse4 (< .cse3 .cse6)) (.cse1 (mod c_~SIZE~0 4294967296))) (and (<= (mod (div (mod (+ 2 (* .cse0 2) |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 3) 4294967296) .cse1) (or .cse2 (<= (mod (div (mod (+ (* .cse3 2) 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 3) 4294967296) .cse1) .cse4) (let ((.cse5 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (or .cse2 (< .cse5 .cse6) (not .cse4) (<= (mod (div (mod (+ (* 2 .cse5) |c_ULTIMATE.start_main_~i~0#1| 4) 4294967296) 3) 4294967296) .cse1)))))) is different from true [2022-07-12 04:15:30,178 WARN L233 SmtUtils]: Spent 8.76s on a formula simplification. DAG size of input: 49 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 04:15:38,928 WARN L233 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 04:15:45,428 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:15:47,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:15:49,682 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []