./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/ps5-ll.c --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/nla-digbench/ps5-ll.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 1d0411df2a3b388d2db53c57aaa1f7219c19c9d74992ef1ed00eab4b9b56cbed --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:12:39,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:12:39,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:12:39,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:12:39,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:12:39,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:12:39,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:12:39,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:12:39,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:12:39,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:12:39,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:12:39,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:12:39,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:12:39,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:12:39,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:12:39,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:12:39,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:12:39,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:12:39,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:12:39,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:12:39,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:12:39,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:12:39,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:12:39,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:12:39,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:12:39,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:12:39,921 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:12:39,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:12:39,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:12:39,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:12:39,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:12:39,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:12:39,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:12:39,927 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:12:39,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:12:39,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:12:39,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:12:39,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:12:39,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:12:39,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:12:39,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:12:39,932 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:12:39,962 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:12:39,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:12:39,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:12:39,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:12:39,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:12:39,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:12:39,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:12:39,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:12:39,965 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:12:39,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:12:39,966 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:12:39,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:12:39,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:12:39,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:12:39,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:12:39,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:12:39,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:12:39,967 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:12:39,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:12:39,967 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:12:39,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:12:39,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:12:39,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:12:39,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:12:39,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:12:39,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:12:39,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:12:39,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:12:39,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:12:39,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:12:39,971 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:12:39,971 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:12:39,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:12:39,971 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 -> 1d0411df2a3b388d2db53c57aaa1f7219c19c9d74992ef1ed00eab4b9b56cbed [2022-02-20 17:12:40,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:12:40,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:12:40,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:12:40,256 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:12:40,257 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:12:40,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/ps5-ll.c [2022-02-20 17:12:40,312 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ce7c464a/ffcc0fe267ba4f4fa9983b0007dbdeb2/FLAGf5928df91 [2022-02-20 17:12:40,651 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:12:40,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/ps5-ll.c [2022-02-20 17:12:40,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ce7c464a/ffcc0fe267ba4f4fa9983b0007dbdeb2/FLAGf5928df91 [2022-02-20 17:12:41,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ce7c464a/ffcc0fe267ba4f4fa9983b0007dbdeb2 [2022-02-20 17:12:41,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:12:41,083 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:12:41,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:12:41,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:12:41,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:12:41,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:12:41" (1/1) ... [2022-02-20 17:12:41,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31bb450f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:41, skipping insertion in model container [2022-02-20 17:12:41,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:12:41" (1/1) ... [2022-02-20 17:12:41,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:12:41,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:12:41,238 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/nla-digbench/ps5-ll.c[458,471] [2022-02-20 17:12:41,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:12:41,259 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:12:41,274 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/nla-digbench/ps5-ll.c[458,471] [2022-02-20 17:12:41,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:12:41,294 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:12:41,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:41 WrapperNode [2022-02-20 17:12:41,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:12:41,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:12:41,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:12:41,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:12:41,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:41" (1/1) ... [2022-02-20 17:12:41,307 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:41" (1/1) ... [2022-02-20 17:12:41,324 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2022-02-20 17:12:41,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:12:41,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:12:41,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:12:41,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:12:41,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:41" (1/1) ... [2022-02-20 17:12:41,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:41" (1/1) ... [2022-02-20 17:12:41,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:41" (1/1) ... [2022-02-20 17:12:41,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:41" (1/1) ... [2022-02-20 17:12:41,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:41" (1/1) ... [2022-02-20 17:12:41,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:41" (1/1) ... [2022-02-20 17:12:41,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:41" (1/1) ... [2022-02-20 17:12:41,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:12:41,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:12:41,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:12:41,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:12:41,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:41" (1/1) ... [2022-02-20 17:12:41,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:12:41,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:12:41,378 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 17:12:41,385 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 17:12:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:12:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:12:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:12:41,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:12:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:12:41,407 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:12:41,444 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:12:41,445 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:12:41,567 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:12:41,572 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:12:41,572 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:12:41,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:12:41 BoogieIcfgContainer [2022-02-20 17:12:41,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:12:41,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:12:41,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:12:41,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:12:41,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:12:41" (1/3) ... [2022-02-20 17:12:41,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60041a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:12:41, skipping insertion in model container [2022-02-20 17:12:41,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:41" (2/3) ... [2022-02-20 17:12:41,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60041a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:12:41, skipping insertion in model container [2022-02-20 17:12:41,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:12:41" (3/3) ... [2022-02-20 17:12:41,580 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll.c [2022-02-20 17:12:41,584 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:12:41,584 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:12:41,619 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:12:41,623 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 17:12:41,623 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:12:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 17:12:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:12:41,640 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:12:41,641 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:12:41,641 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:12:41,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:12:41,646 INFO L85 PathProgramCache]: Analyzing trace with hash -589436290, now seen corresponding path program 1 times [2022-02-20 17:12:41,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:12:41,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432399553] [2022-02-20 17:12:41,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:12:41,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:12:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:12:41,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#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(9, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-02-20 17:12:41,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {22#true} is VALID [2022-02-20 17:12:41,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {23#false} is VALID [2022-02-20 17:12:41,763 INFO L290 TraceCheckUtils]: 3: Hoare triple {23#false} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {23#false} is VALID [2022-02-20 17:12:41,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {23#false} assume false; {23#false} is VALID [2022-02-20 17:12:41,764 INFO L272 TraceCheckUtils]: 5: Hoare triple {23#false} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {23#false} is VALID [2022-02-20 17:12:41,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-02-20 17:12:41,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-02-20 17:12:41,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-02-20 17:12:41,765 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 17:12:41,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:12:41,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432399553] [2022-02-20 17:12:41,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432399553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:12:41,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:12:41,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:12:41,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367313546] [2022-02-20 17:12:41,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:12:41,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2022-02-20 17:12:41,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:12:41,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 17:12:41,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:12:41,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:12:41,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:12:41,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:12:41,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:12:41,833 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 17:12:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:41,871 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2022-02-20 17:12:41,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:12:41,872 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2022-02-20 17:12:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:12:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 17:12:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-02-20 17:12:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 17:12:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-02-20 17:12:41,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2022-02-20 17:12:41,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:12:41,962 INFO L225 Difference]: With dead ends: 35 [2022-02-20 17:12:41,963 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 17:12:41,965 INFO L932 BasicCegarLoop]: 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-02-20 17:12:41,968 INFO L933 BasicCegarLoop]: 21 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, 21 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-02-20 17:12:41,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:12:41,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 17:12:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 17:12:41,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:12:41,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:12:41,992 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:12:41,993 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:12:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:41,996 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:12:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:12:41,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:12:41,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:12:41,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 15 states. [2022-02-20 17:12:41,998 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 15 states. [2022-02-20 17:12:42,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:42,001 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:12:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:12:42,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:12:42,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:12:42,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:12:42,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:12:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:12:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 17:12:42,015 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-02-20 17:12:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:12:42,016 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 17:12:42,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 17:12:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:12:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:12:42,018 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:12:42,018 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:12:42,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:12:42,018 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:12:42,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:12:42,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1187358532, now seen corresponding path program 1 times [2022-02-20 17:12:42,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:12:42,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189115097] [2022-02-20 17:12:42,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:12:42,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:12:42,041 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:12:42,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53866427] [2022-02-20 17:12:42,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:12:42,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:12:42,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:12:42,049 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 17:12:42,050 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 17:12:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:12:42,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:12:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:12:42,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:12:42,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {123#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(9, 2);call #Ultimate.allocInit(12, 3); {123#true} is VALID [2022-02-20 17:12:42,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {123#true} is VALID [2022-02-20 17:12:42,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} assume !(0 == assume_abort_if_not_~cond#1); {123#true} is VALID [2022-02-20 17:12:42,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {123#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {137#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:12:42,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {137#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {137#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:12:42,307 INFO L272 TraceCheckUtils]: 5: Hoare triple {137#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {144#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:12:42,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {144#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {148#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:12:42,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {148#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {124#false} is VALID [2022-02-20 17:12:42,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {124#false} assume !false; {124#false} is VALID [2022-02-20 17:12:42,309 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 17:12:42,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:12:42,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:12:42,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189115097] [2022-02-20 17:12:42,310 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:12:42,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53866427] [2022-02-20 17:12:42,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53866427] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:12:42,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:12:42,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:12:42,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664489564] [2022-02-20 17:12:42,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:12:42,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2022-02-20 17:12:42,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:12:42,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 17:12:42,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:12:42,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:12:42,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:12:42,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:12:42,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:12:42,336 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 17:12:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:42,456 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 17:12:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:12:42,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2022-02-20 17:12:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:12:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 17:12:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-20 17:12:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 17:12:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-20 17:12:42,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-02-20 17:12:42,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:12:42,505 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:12:42,505 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:12:42,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:12:42,506 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:12:42,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:12:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:12:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:12:42,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:12:42,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:12:42,512 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:12:42,513 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:12:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:42,515 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 17:12:42,515 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 17:12:42,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:12:42,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:12:42,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-02-20 17:12:42,516 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-02-20 17:12:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:42,518 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 17:12:42,518 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 17:12:42,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:12:42,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:12:42,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:12:42,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:12:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:12:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-02-20 17:12:42,521 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2022-02-20 17:12:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:12:42,521 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-20 17:12:42,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 17:12:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 17:12:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:12:42,522 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:12:42,522 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:12:42,544 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 17:12:42,736 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 17:12:42,736 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:12:42,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:12:42,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1781398469, now seen corresponding path program 1 times [2022-02-20 17:12:42,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:12:42,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753872692] [2022-02-20 17:12:42,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:12:42,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:12:42,759 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:12:42,759 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2070658] [2022-02-20 17:12:42,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:12:42,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:12:42,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:12:42,761 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 17:12:42,780 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 17:12:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:12:42,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:12:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:12:42,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:12:42,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#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(9, 2);call #Ultimate.allocInit(12, 3); {266#true} is VALID [2022-02-20 17:12:42,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {266#true} is VALID [2022-02-20 17:12:42,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#true} assume !(0 == assume_abort_if_not_~cond#1); {266#true} is VALID [2022-02-20 17:12:42,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {266#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:12:42,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:12:42,970 INFO L272 TraceCheckUtils]: 5: Hoare triple {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {266#true} is VALID [2022-02-20 17:12:42,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#true} ~cond := #in~cond; {266#true} is VALID [2022-02-20 17:12:42,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {266#true} assume !(0 == ~cond); {266#true} is VALID [2022-02-20 17:12:42,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {266#true} assume true; {266#true} is VALID [2022-02-20 17:12:42,971 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {266#true} {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #46#return; {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:12:42,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {302#(and (= (* (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:12:42,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {302#(and (= (* (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !false; {302#(and (= (* (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:12:42,974 INFO L272 TraceCheckUtils]: 12: Hoare triple {302#(and (= (* (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {309#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:12:42,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {309#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {313#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:12:42,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {313#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {267#false} is VALID [2022-02-20 17:12:42,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-02-20 17:12:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:12:42,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:12:43,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-02-20 17:12:43,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {313#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {267#false} is VALID [2022-02-20 17:12:43,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {309#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {313#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:12:43,123 INFO L272 TraceCheckUtils]: 12: Hoare triple {329#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {309#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:12:43,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {329#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} assume !false; {329#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:12:45,146 WARN L290 TraceCheckUtils]: 10: Hoare triple {329#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {329#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is UNKNOWN [2022-02-20 17:12:45,151 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {266#true} {329#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} #46#return; {329#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:12:45,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {266#true} assume true; {266#true} is VALID [2022-02-20 17:12:45,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {266#true} assume !(0 == ~cond); {266#true} is VALID [2022-02-20 17:12:45,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#true} ~cond := #in~cond; {266#true} is VALID [2022-02-20 17:12:45,151 INFO L272 TraceCheckUtils]: 5: Hoare triple {329#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {266#true} is VALID [2022-02-20 17:12:45,154 INFO L290 TraceCheckUtils]: 4: Hoare triple {329#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} assume !false; {329#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:12:45,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {266#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {329#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:12:45,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#true} assume !(0 == assume_abort_if_not_~cond#1); {266#true} is VALID [2022-02-20 17:12:45,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {266#true} is VALID [2022-02-20 17:12:45,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#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(9, 2);call #Ultimate.allocInit(12, 3); {266#true} is VALID [2022-02-20 17:12:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:12:45,156 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:12:45,156 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753872692] [2022-02-20 17:12:45,156 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:12:45,156 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070658] [2022-02-20 17:12:45,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070658] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:12:45,156 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:12:45,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:12:45,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555886477] [2022-02-20 17:12:45,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:12:45,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:12:45,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:12:45,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:12:47,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:12:47,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:12:47,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:12:47,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:12:47,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:12:47,223 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:12:47,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:47,352 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-20 17:12:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:12:47,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:12:47,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:12:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:12:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-20 17:12:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:12:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-20 17:12:47,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2022-02-20 17:12:47,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:12:47,761 INFO L225 Difference]: With dead ends: 28 [2022-02-20 17:12:47,761 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:12:47,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:12:47,762 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 41 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-02-20 17:12:47,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 41 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:12:47,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:12:47,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:12:47,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:12:47,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:12:47,769 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:12:47,769 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:12:47,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:47,771 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-02-20 17:12:47,771 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-20 17:12:47,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:12:47,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:12:47,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 17:12:47,772 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 17:12:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:47,774 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-02-20 17:12:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-20 17:12:47,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:12:47,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:12:47,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:12:47,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:12:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:12:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-02-20 17:12:47,776 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2022-02-20 17:12:47,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:12:47,777 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-02-20 17:12:47,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:12:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-20 17:12:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 17:12:47,778 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:12:47,778 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:12:47,804 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 17:12:48,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:12:48,001 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:12:48,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:12:48,002 INFO L85 PathProgramCache]: Analyzing trace with hash 233982219, now seen corresponding path program 1 times [2022-02-20 17:12:48,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:12:48,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390123557] [2022-02-20 17:12:48,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:12:48,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:12:48,014 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:12:48,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [379725990] [2022-02-20 17:12:48,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:12:48,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:12:48,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:12:48,016 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-02-20 17:12:48,027 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-02-20 17:12:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:12:48,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:12:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:12:48,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:12:48,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {485#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(9, 2);call #Ultimate.allocInit(12, 3); {485#true} is VALID [2022-02-20 17:12:48,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {485#true} is VALID [2022-02-20 17:12:48,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} assume !(0 == assume_abort_if_not_~cond#1); {485#true} is VALID [2022-02-20 17:12:48,399 INFO L290 TraceCheckUtils]: 3: Hoare triple {485#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {499#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:12:48,400 INFO L290 TraceCheckUtils]: 4: Hoare triple {499#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {499#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:12:48,400 INFO L272 TraceCheckUtils]: 5: Hoare triple {499#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {485#true} is VALID [2022-02-20 17:12:48,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {485#true} ~cond := #in~cond; {485#true} is VALID [2022-02-20 17:12:48,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {485#true} assume !(0 == ~cond); {485#true} is VALID [2022-02-20 17:12:48,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {485#true} assume true; {485#true} is VALID [2022-02-20 17:12:48,403 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {485#true} {499#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {499#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:12:48,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {499#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {521#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:12:48,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {521#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !false; {521#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:12:48,404 INFO L272 TraceCheckUtils]: 12: Hoare triple {521#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {485#true} is VALID [2022-02-20 17:12:48,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {485#true} ~cond := #in~cond; {485#true} is VALID [2022-02-20 17:12:48,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {485#true} assume !(0 == ~cond); {485#true} is VALID [2022-02-20 17:12:48,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {485#true} assume true; {485#true} is VALID [2022-02-20 17:12:48,405 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {485#true} {521#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #46#return; {521#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:12:48,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {521#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {543#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:12:48,406 INFO L272 TraceCheckUtils]: 18: Hoare triple {543#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {485#true} is VALID [2022-02-20 17:12:48,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {485#true} ~cond := #in~cond; {485#true} is VALID [2022-02-20 17:12:48,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {485#true} assume !(0 == ~cond); {485#true} is VALID [2022-02-20 17:12:48,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {485#true} assume true; {485#true} is VALID [2022-02-20 17:12:48,407 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {485#true} {543#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #48#return; {543#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:12:48,408 INFO L272 TraceCheckUtils]: 23: Hoare triple {543#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {562#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:12:48,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {562#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {566#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:12:48,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {566#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {486#false} is VALID [2022-02-20 17:12:48,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {486#false} assume !false; {486#false} is VALID [2022-02-20 17:12:48,409 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:12:48,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:12:48,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:12:48,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390123557] [2022-02-20 17:12:48,804 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:12:48,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379725990] [2022-02-20 17:12:48,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379725990] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:12:48,804 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:12:48,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:12:48,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068046] [2022-02-20 17:12:48,804 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:12:48,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-02-20 17:12:48,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:12:48,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:12:48,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:12:48,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:12:48,833 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:12:48,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:12:48,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:12:48,834 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:12:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:49,022 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-20 17:12:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:12:49,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-02-20 17:12:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:12:49,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:12:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-02-20 17:12:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:12:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-02-20 17:12:49,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-02-20 17:12:49,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:12:49,063 INFO L225 Difference]: With dead ends: 33 [2022-02-20 17:12:49,063 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 17:12:49,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:12:49,064 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:12:49,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 95 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:12:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 17:12:49,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 17:12:49,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:12:49,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:12:49,075 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:12:49,075 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:12:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:49,077 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-02-20 17:12:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 17:12:49,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:12:49,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:12:49,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-02-20 17:12:49,078 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-02-20 17:12:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:49,079 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-02-20 17:12:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 17:12:49,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:12:49,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:12:49,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:12:49,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:12:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:12:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-02-20 17:12:49,082 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 27 [2022-02-20 17:12:49,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:12:49,082 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-02-20 17:12:49,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:12:49,083 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 17:12:49,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 17:12:49,084 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:12:49,084 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:12:49,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:12:49,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:12:49,300 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:12:49,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:12:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash -595331518, now seen corresponding path program 2 times [2022-02-20 17:12:49,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:12:49,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256761342] [2022-02-20 17:12:49,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:12:49,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:12:49,315 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:12:49,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777426443] [2022-02-20 17:12:49,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:12:49,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:12:49,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:12:49,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:12:49,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:12:49,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:12:49,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:12:49,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:12:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:12:49,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:12:49,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#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(9, 2);call #Ultimate.allocInit(12, 3); {772#true} is VALID [2022-02-20 17:12:49,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {772#true} is VALID [2022-02-20 17:12:49,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#true} assume !(0 == assume_abort_if_not_~cond#1); {772#true} is VALID [2022-02-20 17:12:49,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {772#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {786#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:12:49,753 INFO L290 TraceCheckUtils]: 4: Hoare triple {786#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {786#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:12:49,753 INFO L272 TraceCheckUtils]: 5: Hoare triple {786#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {772#true} is VALID [2022-02-20 17:12:49,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#true} ~cond := #in~cond; {772#true} is VALID [2022-02-20 17:12:49,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {772#true} assume !(0 == ~cond); {772#true} is VALID [2022-02-20 17:12:49,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {772#true} assume true; {772#true} is VALID [2022-02-20 17:12:49,755 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {772#true} {786#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {786#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:12:49,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {786#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {808#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:12:49,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {808#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {808#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:12:49,756 INFO L272 TraceCheckUtils]: 12: Hoare triple {808#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {772#true} is VALID [2022-02-20 17:12:49,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {772#true} ~cond := #in~cond; {772#true} is VALID [2022-02-20 17:12:49,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {772#true} assume !(0 == ~cond); {772#true} is VALID [2022-02-20 17:12:49,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {772#true} assume true; {772#true} is VALID [2022-02-20 17:12:49,757 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {772#true} {808#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {808#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:12:49,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {808#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {830#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:12:49,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {830#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !false; {830#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:12:49,758 INFO L272 TraceCheckUtils]: 19: Hoare triple {830#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {772#true} is VALID [2022-02-20 17:12:49,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {772#true} ~cond := #in~cond; {772#true} is VALID [2022-02-20 17:12:49,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {772#true} assume !(0 == ~cond); {772#true} is VALID [2022-02-20 17:12:49,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {772#true} assume true; {772#true} is VALID [2022-02-20 17:12:49,760 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {772#true} {830#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} #46#return; {830#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:12:49,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {830#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !(main_~c~0#1 < main_~k~0#1); {852#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:12:49,760 INFO L272 TraceCheckUtils]: 25: Hoare triple {852#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {772#true} is VALID [2022-02-20 17:12:49,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {772#true} ~cond := #in~cond; {772#true} is VALID [2022-02-20 17:12:49,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {772#true} assume !(0 == ~cond); {772#true} is VALID [2022-02-20 17:12:49,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {772#true} assume true; {772#true} is VALID [2022-02-20 17:12:49,764 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {772#true} {852#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} #48#return; {852#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:12:49,764 INFO L272 TraceCheckUtils]: 30: Hoare triple {852#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {871#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:12:49,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {871#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {875#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:12:49,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {875#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {773#false} is VALID [2022-02-20 17:12:49,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {773#false} assume !false; {773#false} is VALID [2022-02-20 17:12:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:12:49,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:12:50,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:12:50,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256761342] [2022-02-20 17:12:50,053 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:12:50,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777426443] [2022-02-20 17:12:50,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777426443] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:12:50,053 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:12:50,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:12:50,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955131075] [2022-02-20 17:12:50,054 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:12:50,054 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-02-20 17:12:50,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:12:50,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:12:50,083 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 17:12:50,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:12:50,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:12:50,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:12:50,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:12:50,084 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:12:50,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:50,369 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-02-20 17:12:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:12:50,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-02-20 17:12:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:12:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:12:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-02-20 17:12:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:12:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-02-20 17:12:50,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2022-02-20 17:12:50,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:12:50,414 INFO L225 Difference]: With dead ends: 36 [2022-02-20 17:12:50,414 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:12:50,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:12:50,415 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:12:50,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:12:50,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:12:50,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 17:12:50,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:12:50,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:12:50,429 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:12:50,429 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:12:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:50,431 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-02-20 17:12:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 17:12:50,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:12:50,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:12:50,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-02-20 17:12:50,432 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-02-20 17:12:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:50,433 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-02-20 17:12:50,433 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 17:12:50,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:12:50,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:12:50,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:12:50,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:12:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:12:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-02-20 17:12:50,436 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 34 [2022-02-20 17:12:50,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:12:50,436 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-02-20 17:12:50,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:12:50,436 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 17:12:50,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 17:12:50,437 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:12:50,437 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:12:50,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:12:50,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:12:50,642 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:12:50,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:12:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash 897994027, now seen corresponding path program 3 times [2022-02-20 17:12:50,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:12:50,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657227718] [2022-02-20 17:12:50,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:12:50,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:12:50,658 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:12:50,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8817509] [2022-02-20 17:12:50,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:12:50,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:12:50,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:12:50,659 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:12:50,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process