./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound2.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-scaling/sqrt1-ll_valuebound2.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 69e3759b6e7ee15378e7391ad11d943bae32b67ab55c3e2fea94db5284daa3ec --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:44:29,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:44:29,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:44:29,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:44:29,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:44:29,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:44:29,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:44:29,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:44:29,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:44:29,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:44:29,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:44:29,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:44:29,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:44:29,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:44:29,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:44:29,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:44:29,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:44:29,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:44:29,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:44:29,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:44:29,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:44:29,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:44:29,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:44:29,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:44:29,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:44:29,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:44:29,302 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:44:29,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:44:29,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:44:29,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:44:29,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:44:29,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:44:29,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:44:29,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:44:29,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:44:29,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:44:29,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:44:29,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:44:29,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:44:29,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:44:29,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:44:29,313 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:44:29,337 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:44:29,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:44:29,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:44:29,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:44:29,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:44:29,339 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:44:29,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:44:29,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:44:29,340 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:44:29,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:44:29,341 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:44:29,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:44:29,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:44:29,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:44:29,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:44:29,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:44:29,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:44:29,343 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:44:29,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:44:29,343 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:44:29,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:44:29,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:44:29,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:44:29,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:44:29,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:44:29,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:44:29,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:44:29,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:44:29,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:44:29,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:44:29,345 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:44:29,345 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:44:29,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:44:29,346 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 -> 69e3759b6e7ee15378e7391ad11d943bae32b67ab55c3e2fea94db5284daa3ec [2022-02-20 17:44:29,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:44:29,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:44:29,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:44:29,591 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:44:29,592 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:44:29,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound2.c [2022-02-20 17:44:29,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430146b2e/d20aa4c28f444393806743e45cd71354/FLAGc72018595 [2022-02-20 17:44:30,064 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:44:30,064 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound2.c [2022-02-20 17:44:30,073 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430146b2e/d20aa4c28f444393806743e45cd71354/FLAGc72018595 [2022-02-20 17:44:30,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430146b2e/d20aa4c28f444393806743e45cd71354 [2022-02-20 17:44:30,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:44:30,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:44:30,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:44:30,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:44:30,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:44:30,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:44:30" (1/1) ... [2022-02-20 17:44:30,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fdc757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:30, skipping insertion in model container [2022-02-20 17:44:30,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:44:30" (1/1) ... [2022-02-20 17:44:30,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:44:30,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:44:30,271 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-scaling/sqrt1-ll_valuebound2.c[520,533] [2022-02-20 17:44:30,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:44:30,291 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:44:30,301 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-scaling/sqrt1-ll_valuebound2.c[520,533] [2022-02-20 17:44:30,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:44:30,319 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:44:30,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:30 WrapperNode [2022-02-20 17:44:30,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:44:30,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:44:30,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:44:30,321 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:44:30,327 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:44:30" (1/1) ... [2022-02-20 17:44:30,333 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:44:30" (1/1) ... [2022-02-20 17:44:30,355 INFO L137 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2022-02-20 17:44:30,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:44:30,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:44:30,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:44:30,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:44:30,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:30" (1/1) ... [2022-02-20 17:44:30,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:30" (1/1) ... [2022-02-20 17:44:30,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:30" (1/1) ... [2022-02-20 17:44:30,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:30" (1/1) ... [2022-02-20 17:44:30,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:30" (1/1) ... [2022-02-20 17:44:30,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:30" (1/1) ... [2022-02-20 17:44:30,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:30" (1/1) ... [2022-02-20 17:44:30,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:44:30,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:44:30,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:44:30,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:44:30,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:30" (1/1) ... [2022-02-20 17:44:30,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:44:30,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:30,404 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:44:30,406 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:44:30,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:44:30,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:44:30,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:44:30,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:44:30,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:44:30,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:44:30,474 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:44:30,475 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:44:30,582 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:44:30,588 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:44:30,588 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:44:30,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:44:30 BoogieIcfgContainer [2022-02-20 17:44:30,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:44:30,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:44:30,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:44:30,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:44:30,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:44:30" (1/3) ... [2022-02-20 17:44:30,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e224b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:44:30, skipping insertion in model container [2022-02-20 17:44:30,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:30" (2/3) ... [2022-02-20 17:44:30,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e224b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:44:30, skipping insertion in model container [2022-02-20 17:44:30,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:44:30" (3/3) ... [2022-02-20 17:44:30,597 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound2.c [2022-02-20 17:44:30,601 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:44:30,602 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:44:30,640 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:44:30,645 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:44:30,646 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:44:30,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:44:30,671 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:30,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:30,672 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:30,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:30,677 INFO L85 PathProgramCache]: Analyzing trace with hash -589224774, now seen corresponding path program 1 times [2022-02-20 17:44:30,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:30,691 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841682142] [2022-02-20 17:44:30,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:30,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:30,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#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(11, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-02-20 17:44:30,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~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_~n~0#1 >= 0 && main_~n~0#1 <= 2 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {25#true} is VALID [2022-02-20 17:44:30,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {26#false} is VALID [2022-02-20 17:44:30,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#false} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {26#false} is VALID [2022-02-20 17:44:30,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#false} assume false; {26#false} is VALID [2022-02-20 17:44:30,821 INFO L272 TraceCheckUtils]: 5: Hoare triple {26#false} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {26#false} is VALID [2022-02-20 17:44:30,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-02-20 17:44:30,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-02-20 17:44:30,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-02-20 17:44:30,823 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:44:30,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:30,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841682142] [2022-02-20 17:44:30,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841682142] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:44:30,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:44:30,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:44:30,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940580473] [2022-02-20 17:44:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:44:30,874 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:44:30,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:30,878 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:44:30,901 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:44:30,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:44:30,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:30,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:44:30,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:44:30,933 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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:44:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:31,025 INFO L93 Difference]: Finished difference Result 41 states and 64 transitions. [2022-02-20 17:44:31,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:44:31,026 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:44:31,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:31,028 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:44:31,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 17:44:31,051 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:44:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 17:44:31,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2022-02-20 17:44:31,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:31,178 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:44:31,179 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 17:44:31,182 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:44:31,186 INFO L933 BasicCegarLoop]: 27 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, 27 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:44:31,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:44:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 17:44:31,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 17:44:31,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:31,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:31,221 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:31,222 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:31,227 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-20 17:44:31,227 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-02-20 17:44:31,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:31,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:31,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 18 states. [2022-02-20 17:44:31,230 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 18 states. [2022-02-20 17:44:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:31,234 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-20 17:44:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-02-20 17:44:31,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:31,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:31,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:31,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-02-20 17:44:31,245 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 9 [2022-02-20 17:44:31,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:31,246 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-02-20 17:44:31,247 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:44:31,247 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-02-20 17:44:31,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:44:31,248 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:31,248 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:31,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:44:31,249 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:31,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:31,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1187450884, now seen corresponding path program 1 times [2022-02-20 17:44:31,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:31,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167453459] [2022-02-20 17:44:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:31,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#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(11, 2);call #Ultimate.allocInit(12, 3); {150#true} is VALID [2022-02-20 17:44:31,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~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_~n~0#1 >= 0 && main_~n~0#1 <= 2 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {150#true} is VALID [2022-02-20 17:44:31,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume !(0 == assume_abort_if_not_~cond#1); {150#true} is VALID [2022-02-20 17:44:31,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {152#(and (= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|))) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:44:31,377 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#(and (= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|))) (= |ULTIMATE.start_main_~a~0#1| 0))} assume !false; {152#(and (= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|))) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:44:31,378 INFO L272 TraceCheckUtils]: 5: Hoare triple {152#(and (= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|))) (= |ULTIMATE.start_main_~a~0#1| 0))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {153#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:44:31,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {153#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {154#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:44:31,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {154#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {151#false} is VALID [2022-02-20 17:44:31,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#false} assume !false; {151#false} is VALID [2022-02-20 17:44:31,385 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:44:31,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:31,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167453459] [2022-02-20 17:44:31,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167453459] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:44:31,386 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:44:31,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:44:31,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488398240] [2022-02-20 17:44:31,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:44:31,389 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:44:31,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:31,389 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:44:31,398 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:44:31,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:44:31,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:31,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:44:31,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:44:31,402 INFO L87 Difference]: Start difference. First operand 18 states and 23 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:44:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:31,554 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-02-20 17:44:31,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:44:31,555 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:44:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:31,555 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:44:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 17:44:31,558 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:44:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 17:44:31,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-02-20 17:44:31,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:31,611 INFO L225 Difference]: With dead ends: 32 [2022-02-20 17:44:31,611 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:44:31,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:44:31,613 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:31,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:44:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:44:31,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-02-20 17:44:31,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:31,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:31,620 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:31,620 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:31,623 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-20 17:44:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 17:44:31,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:31,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:31,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 30 states. [2022-02-20 17:44:31,625 INFO L87 Difference]: Start difference. First operand has 28 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 30 states. [2022-02-20 17:44:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:31,628 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-20 17:44:31,628 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 17:44:31,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:31,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:31,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:31,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-20 17:44:31,632 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 9 [2022-02-20 17:44:31,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:31,633 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-20 17:44:31,633 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:44:31,633 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:44:31,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:44:31,634 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:31,634 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:31,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:44:31,634 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:31,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:31,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1170702338, now seen corresponding path program 1 times [2022-02-20 17:44:31,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:31,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290151560] [2022-02-20 17:44:31,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:31,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:31,650 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:31,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [338966697] [2022-02-20 17:44:31,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:31,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:31,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:31,653 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:44:31,654 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:44:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:31,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:44:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:31,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:31,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {309#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(11, 2);call #Ultimate.allocInit(12, 3); {309#true} is VALID [2022-02-20 17:44:31,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~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_~n~0#1 >= 0 && main_~n~0#1 <= 2 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {309#true} is VALID [2022-02-20 17:44:31,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume !(0 == assume_abort_if_not_~cond#1); {309#true} is VALID [2022-02-20 17:44:31,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {309#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {323#(and (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:31,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {323#(and (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !false; {323#(and (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:31,820 INFO L272 TraceCheckUtils]: 5: Hoare triple {323#(and (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {309#true} is VALID [2022-02-20 17:44:31,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#true} ~cond := #in~cond; {309#true} is VALID [2022-02-20 17:44:31,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#true} assume !(0 == ~cond); {309#true} is VALID [2022-02-20 17:44:31,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} assume true; {309#true} is VALID [2022-02-20 17:44:31,821 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {309#true} {323#(and (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} #49#return; {323#(and (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:31,822 INFO L272 TraceCheckUtils]: 10: Hoare triple {323#(and (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {345#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:31,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {345#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {349#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:31,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {349#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {310#false} is VALID [2022-02-20 17:44:31,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {310#false} assume !false; {310#false} is VALID [2022-02-20 17:44:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:44:31,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:44:31,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:31,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290151560] [2022-02-20 17:44:31,825 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:31,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338966697] [2022-02-20 17:44:31,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338966697] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:44:31,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:44:31,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:44:31,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128413701] [2022-02-20 17:44:31,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:44:31,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2022-02-20 17:44:31,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:31,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:44:31,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:31,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:44:31,840 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:31,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:44:31,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:44:31,841 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:44:31,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:31,982 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-20 17:44:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:44:31,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2022-02-20 17:44:31,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:44:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 17:44:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:44:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 17:44:31,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-02-20 17:44:32,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:32,036 INFO L225 Difference]: With dead ends: 36 [2022-02-20 17:44:32,036 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 17:44:32,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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:44:32,040 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:32,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 83 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:44:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 17:44:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-02-20 17:44:32,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:32,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:32,063 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:32,063 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:32,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:32,066 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-20 17:44:32,066 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 17:44:32,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:32,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:32,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-02-20 17:44:32,072 INFO L87 Difference]: Start difference. First operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-02-20 17:44:32,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:32,080 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-20 17:44:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 17:44:32,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:32,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:32,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:32,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-02-20 17:44:32,087 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 14 [2022-02-20 17:44:32,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:32,087 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-02-20 17:44:32,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:44:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-02-20 17:44:32,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:44:32,088 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:32,089 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:32,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:44:32,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:32,304 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:32,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1035962748, now seen corresponding path program 1 times [2022-02-20 17:44:32,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:32,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584301228] [2022-02-20 17:44:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:32,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:32,317 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:32,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [350214439] [2022-02-20 17:44:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:32,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:32,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:32,322 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:44:32,324 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:44:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:32,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:44:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:32,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:32,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#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(11, 2);call #Ultimate.allocInit(12, 3); {527#true} is VALID [2022-02-20 17:44:32,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~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_~n~0#1 >= 0 && main_~n~0#1 <= 2 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {527#true} is VALID [2022-02-20 17:44:32,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume !(0 == assume_abort_if_not_~cond#1); {527#true} is VALID [2022-02-20 17:44:32,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {527#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:32,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !false; {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:32,472 INFO L272 TraceCheckUtils]: 5: Hoare triple {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {527#true} is VALID [2022-02-20 17:44:32,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2022-02-20 17:44:32,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2022-02-20 17:44:32,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {527#true} assume true; {527#true} is VALID [2022-02-20 17:44:32,473 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {527#true} {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} #49#return; {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:32,473 INFO L272 TraceCheckUtils]: 10: Hoare triple {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {527#true} is VALID [2022-02-20 17:44:32,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2022-02-20 17:44:32,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2022-02-20 17:44:32,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {527#true} assume true; {527#true} is VALID [2022-02-20 17:44:32,475 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {527#true} {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} #51#return; {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:32,476 INFO L272 TraceCheckUtils]: 15: Hoare triple {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if 0 == 1 + (main_~t~0#1 * main_~t~0#1 - 4 * main_~s~0#1 + 2 * main_~t~0#1) then 1 else 0)); {578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:32,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:32,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {528#false} is VALID [2022-02-20 17:44:32,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {528#false} assume !false; {528#false} is VALID [2022-02-20 17:44:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:44:32,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:44:32,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:32,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584301228] [2022-02-20 17:44:32,481 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:32,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350214439] [2022-02-20 17:44:32,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350214439] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:44:32,483 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:44:32,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:44:32,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840570352] [2022-02-20 17:44:32,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:44:32,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:44:32,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:32,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:44:32,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:32,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:44:32,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:32,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:44:32,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:44:32,507 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:44:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:32,656 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-02-20 17:44:32,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:44:32,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:44:32,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:44:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 17:44:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:44:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 17:44:32,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-02-20 17:44:32,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:32,710 INFO L225 Difference]: With dead ends: 40 [2022-02-20 17:44:32,710 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 17:44:32,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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:44:32,712 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:32,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 86 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:44:32,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 17:44:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-02-20 17:44:32,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:32,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:32,723 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:32,723 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:32,725 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-02-20 17:44:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-02-20 17:44:32,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:32,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:32,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-02-20 17:44:32,727 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-02-20 17:44:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:32,728 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-02-20 17:44:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-02-20 17:44:32,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:32,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:32,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:32,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-02-20 17:44:32,731 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 19 [2022-02-20 17:44:32,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:32,731 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-02-20 17:44:32,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:44:32,732 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-02-20 17:44:32,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:44:32,732 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:32,732 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:32,757 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:44:32,947 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,SelfDestructingSolverStorable3 [2022-02-20 17:44:32,948 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:32,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:32,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1637726784, now seen corresponding path program 1 times [2022-02-20 17:44:32,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:32,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450789173] [2022-02-20 17:44:32,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:32,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:32,966 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:32,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1330808288] [2022-02-20 17:44:32,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:32,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:32,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:32,969 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:44:32,971 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:44:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:33,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:44:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:33,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:33,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {768#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(11, 2);call #Ultimate.allocInit(12, 3); {768#true} is VALID [2022-02-20 17:44:33,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~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_~n~0#1 >= 0 && main_~n~0#1 <= 2 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {768#true} is VALID [2022-02-20 17:44:33,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} assume !(0 == assume_abort_if_not_~cond#1); {768#true} is VALID [2022-02-20 17:44:33,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {768#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:44:33,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} assume !false; {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:44:33,171 INFO L272 TraceCheckUtils]: 5: Hoare triple {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {768#true} is VALID [2022-02-20 17:44:33,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {768#true} ~cond := #in~cond; {768#true} is VALID [2022-02-20 17:44:33,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {768#true} assume !(0 == ~cond); {768#true} is VALID [2022-02-20 17:44:33,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {768#true} assume true; {768#true} is VALID [2022-02-20 17:44:33,173 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {768#true} {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} #49#return; {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:44:33,173 INFO L272 TraceCheckUtils]: 10: Hoare triple {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {768#true} is VALID [2022-02-20 17:44:33,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {768#true} ~cond := #in~cond; {768#true} is VALID [2022-02-20 17:44:33,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {768#true} assume !(0 == ~cond); {768#true} is VALID [2022-02-20 17:44:33,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {768#true} assume true; {768#true} is VALID [2022-02-20 17:44:33,174 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {768#true} {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} #51#return; {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:44:33,174 INFO L272 TraceCheckUtils]: 15: Hoare triple {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} call __VERIFIER_assert((if 0 == 1 + (main_~t~0#1 * main_~t~0#1 - 4 * main_~s~0#1 + 2 * main_~t~0#1) then 1 else 0)); {768#true} is VALID [2022-02-20 17:44:33,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {768#true} ~cond := #in~cond; {768#true} is VALID [2022-02-20 17:44:33,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {768#true} assume !(0 == ~cond); {768#true} is VALID [2022-02-20 17:44:33,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {768#true} assume true; {768#true} is VALID [2022-02-20 17:44:33,175 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {768#true} {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} #53#return; {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:44:33,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} assume !!(main_~s~0#1 <= main_~n~0#1);main_~a~0#1 := 1 + main_~a~0#1;main_~t~0#1 := 2 + main_~t~0#1;main_~s~0#1 := main_~s~0#1 + main_~t~0#1; {834#(and (= 3 |ULTIMATE.start_main_~t~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~a~0#1|) 0))} is VALID [2022-02-20 17:44:33,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {834#(and (= 3 |ULTIMATE.start_main_~t~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~a~0#1|) 0))} assume !false; {834#(and (= 3 |ULTIMATE.start_main_~t~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~a~0#1|) 0))} is VALID [2022-02-20 17:44:33,177 INFO L272 TraceCheckUtils]: 22: Hoare triple {834#(and (= 3 |ULTIMATE.start_main_~t~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~a~0#1|) 0))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {841#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:33,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {841#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {845#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:33,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {845#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {769#false} is VALID [2022-02-20 17:44:33,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {769#false} assume !false; {769#false} is VALID [2022-02-20 17:44:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:44:33,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:33,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {769#false} assume !false; {769#false} is VALID [2022-02-20 17:44:33,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {845#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {769#false} is VALID [2022-02-20 17:44:33,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {841#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {845#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:33,321 INFO L272 TraceCheckUtils]: 22: Hoare triple {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {841#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:33,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !false; {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:33,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !!(main_~s~0#1 <= main_~n~0#1);main_~a~0#1 := 1 + main_~a~0#1;main_~t~0#1 := 2 + main_~t~0#1;main_~s~0#1 := main_~s~0#1 + main_~t~0#1; {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:33,323 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {768#true} {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} #53#return; {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:33,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {768#true} assume true; {768#true} is VALID [2022-02-20 17:44:33,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {768#true} assume !(0 == ~cond); {768#true} is VALID [2022-02-20 17:44:33,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {768#true} ~cond := #in~cond; {768#true} is VALID [2022-02-20 17:44:33,323 INFO L272 TraceCheckUtils]: 15: Hoare triple {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if 0 == 1 + (main_~t~0#1 * main_~t~0#1 - 4 * main_~s~0#1 + 2 * main_~t~0#1) then 1 else 0)); {768#true} is VALID [2022-02-20 17:44:33,324 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {768#true} {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} #51#return; {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:33,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {768#true} assume true; {768#true} is VALID [2022-02-20 17:44:33,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {768#true} assume !(0 == ~cond); {768#true} is VALID [2022-02-20 17:44:33,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {768#true} ~cond := #in~cond; {768#true} is VALID [2022-02-20 17:44:33,325 INFO L272 TraceCheckUtils]: 10: Hoare triple {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {768#true} is VALID [2022-02-20 17:44:33,325 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {768#true} {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} #49#return; {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:33,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {768#true} assume true; {768#true} is VALID [2022-02-20 17:44:33,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {768#true} assume !(0 == ~cond); {768#true} is VALID [2022-02-20 17:44:33,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {768#true} ~cond := #in~cond; {768#true} is VALID [2022-02-20 17:44:33,326 INFO L272 TraceCheckUtils]: 5: Hoare triple {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {768#true} is VALID [2022-02-20 17:44:33,327 INFO L290 TraceCheckUtils]: 4: Hoare triple {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !false; {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:33,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {768#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:33,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} assume !(0 == assume_abort_if_not_~cond#1); {768#true} is VALID [2022-02-20 17:44:33,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~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_~n~0#1 >= 0 && main_~n~0#1 <= 2 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {768#true} is VALID [2022-02-20 17:44:33,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {768#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(11, 2);call #Ultimate.allocInit(12, 3); {768#true} is VALID [2022-02-20 17:44:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 17:44:33,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:33,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450789173] [2022-02-20 17:44:33,329 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:33,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330808288] [2022-02-20 17:44:33,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330808288] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:33,329 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:33,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:44:33,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325218221] [2022-02-20 17:44:33,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:44:33,330 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:44:33,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:33,333 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:44:33,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:33,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:44:33,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:33,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:44:33,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:44:33,356 INFO L87 Difference]: Start difference. First operand 35 states and 40 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:44:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:33,575 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-02-20 17:44:33,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:44:33,575 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:44:33,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:33,576 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:44:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:44:33,577 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:44:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:44:33,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-02-20 17:44:33,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:33,612 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:44:33,612 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 17:44:33,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:44:33,612 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:33,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 59 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:44:33,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 17:44:33,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 17:44:33,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:33,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:33,622 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:33,622 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:33,624 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 17:44:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 17:44:33,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:33,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:33,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-02-20 17:44:33,625 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-02-20 17:44:33,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:33,626 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 17:44:33,626 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 17:44:33,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:33,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:33,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:33,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-02-20 17:44:33,629 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2022-02-20 17:44:33,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:33,629 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-02-20 17:44:33,629 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:44:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 17:44:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 17:44:33,630 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:33,630 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:33,656 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:44:33,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:33,848 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:33,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:33,848 INFO L85 PathProgramCache]: Analyzing trace with hash 682917830, now seen corresponding path program 2 times [2022-02-20 17:44:33,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:33,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465732532] [2022-02-20 17:44:33,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:33,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:33,862 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:33,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [156788724] [2022-02-20 17:44:33,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:44:33,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:33,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:33,879 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:44:33,881 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:44:33,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:44:33,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:33,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 17:44:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:33,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:34,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {1119#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(11, 2);call #Ultimate.allocInit(12, 3); {1119#true} is VALID [2022-02-20 17:44:34,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {1119#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~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_~n~0#1 >= 0 && main_~n~0#1 <= 2 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1119#true} is VALID [2022-02-20 17:44:34,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {1119#true} assume !(0 == assume_abort_if_not_~cond#1); {1119#true} is VALID [2022-02-20 17:44:34,131 INFO L290 TraceCheckUtils]: 3: Hoare triple {1119#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:34,131 INFO L290 TraceCheckUtils]: 4: Hoare triple {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !false; {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:34,131 INFO L272 TraceCheckUtils]: 5: Hoare triple {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:34,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:34,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:34,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:34,133 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1119#true} {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} #49#return; {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:34,133 INFO L272 TraceCheckUtils]: 10: Hoare triple {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:34,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:34,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:34,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:34,135 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1119#true} {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} #51#return; {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:34,135 INFO L272 TraceCheckUtils]: 15: Hoare triple {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if 0 == 1 + (main_~t~0#1 * main_~t~0#1 - 4 * main_~s~0#1 + 2 * main_~t~0#1) then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:34,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:34,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:34,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:34,148 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1119#true} {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} #53#return; {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:34,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_~s~0#1 <= main_~n~0#1);main_~a~0#1 := 1 + main_~a~0#1;main_~t~0#1 := 2 + main_~t~0#1;main_~s~0#1 := main_~s~0#1 + main_~t~0#1; {1185#(and (= (+ (- 3) |ULTIMATE.start_main_~s~0#1|) 1) (= |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-20 17:44:34,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {1185#(and (= (+ (- 3) |ULTIMATE.start_main_~s~0#1|) 1) (= |ULTIMATE.start_main_~a~0#1| 1))} assume !false; {1185#(and (= (+ (- 3) |ULTIMATE.start_main_~s~0#1|) 1) (= |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-20 17:44:34,149 INFO L272 TraceCheckUtils]: 22: Hoare triple {1185#(and (= (+ (- 3) |ULTIMATE.start_main_~s~0#1|) 1) (= |ULTIMATE.start_main_~a~0#1| 1))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:34,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:34,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:34,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:34,150 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1119#true} {1185#(and (= (+ (- 3) |ULTIMATE.start_main_~s~0#1|) 1) (= |ULTIMATE.start_main_~a~0#1| 1))} #49#return; {1185#(and (= (+ (- 3) |ULTIMATE.start_main_~s~0#1|) 1) (= |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-20 17:44:34,151 INFO L272 TraceCheckUtils]: 27: Hoare triple {1185#(and (= (+ (- 3) |ULTIMATE.start_main_~s~0#1|) 1) (= |ULTIMATE.start_main_~a~0#1| 1))} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {1207#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:34,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {1207#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1211#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:34,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {1211#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1120#false} is VALID [2022-02-20 17:44:34,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {1120#false} assume !false; {1120#false} is VALID [2022-02-20 17:44:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:44:34,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:34,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {1120#false} assume !false; {1120#false} is VALID [2022-02-20 17:44:34,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {1211#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1120#false} is VALID [2022-02-20 17:44:34,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {1207#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1211#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:34,326 INFO L272 TraceCheckUtils]: 27: Hoare triple {1227#(= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|)} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {1207#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:34,326 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1119#true} {1227#(= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|)} #49#return; {1227#(= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|)} is VALID [2022-02-20 17:44:34,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:34,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:34,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:34,327 INFO L272 TraceCheckUtils]: 22: Hoare triple {1227#(= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|)} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:34,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {1227#(= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|)} assume !false; {1227#(= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|)} is VALID [2022-02-20 17:44:34,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !!(main_~s~0#1 <= main_~n~0#1);main_~a~0#1 := 1 + main_~a~0#1;main_~t~0#1 := 2 + main_~t~0#1;main_~s~0#1 := main_~s~0#1 + main_~t~0#1; {1227#(= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|)} is VALID [2022-02-20 17:44:34,356 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1119#true} {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} #53#return; {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:34,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:34,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:34,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:34,357 INFO L272 TraceCheckUtils]: 15: Hoare triple {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if 0 == 1 + (main_~t~0#1 * main_~t~0#1 - 4 * main_~s~0#1 + 2 * main_~t~0#1) then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:34,357 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1119#true} {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} #51#return; {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:34,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:34,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:34,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:34,358 INFO L272 TraceCheckUtils]: 10: Hoare triple {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:34,359 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1119#true} {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} #49#return; {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:34,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:34,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:34,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:34,359 INFO L272 TraceCheckUtils]: 5: Hoare triple {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:34,360 INFO L290 TraceCheckUtils]: 4: Hoare triple {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !false; {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:34,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {1119#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:34,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {1119#true} assume !(0 == assume_abort_if_not_~cond#1); {1119#true} is VALID [2022-02-20 17:44:34,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {1119#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~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_~n~0#1 >= 0 && main_~n~0#1 <= 2 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1119#true} is VALID [2022-02-20 17:44:34,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {1119#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(11, 2);call #Ultimate.allocInit(12, 3); {1119#true} is VALID [2022-02-20 17:44:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:44:34,361 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:34,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465732532] [2022-02-20 17:44:34,361 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:34,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156788724] [2022-02-20 17:44:34,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156788724] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:44:34,362 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:44:34,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 17:44:34,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693816534] [2022-02-20 17:44:34,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:34,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 31 [2022-02-20 17:44:34,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:34,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 17:44:34,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:34,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:44:34,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:34,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:44:34,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:44:34,398 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 17:44:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:34,792 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-02-20 17:44:34,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:44:34,792 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 31 [2022-02-20 17:44:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 17:44:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-02-20 17:44:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 17:44:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-02-20 17:44:34,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-02-20 17:44:34,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:34,861 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:44:34,862 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:44:34,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:44:34,863 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:34,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 63 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:44:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:44:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:44:34,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:34,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:44:34,864 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:44:34,864 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:44:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:34,864 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:44:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:44:34,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:34,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:34,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:44:34,865 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:44:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:34,865 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:44:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:44:34,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:34,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:34,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:34,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:44:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:44:34,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2022-02-20 17:44:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:34,866 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:44:34,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 17:44:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:44:34,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:34,868 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:44:34,895 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:44:35,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:35,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:44:35,235 INFO L858 garLoopResultBuilder]: For program point L33(lines 30 42) no Hoare annotation was computed. [2022-02-20 17:44:35,235 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:44:35,235 INFO L854 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~a~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| (+ 1 .cse0)) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 .cse0) |ULTIMATE.start_main_~s~0#1|))) [2022-02-20 17:44:35,235 INFO L854 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~a~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| (+ 1 .cse0)) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 .cse0) |ULTIMATE.start_main_~s~0#1|))) [2022-02-20 17:44:35,236 INFO L861 garLoopResultBuilder]: At program point L48(lines 20 49) the Hoare annotation is: true [2022-02-20 17:44:35,236 INFO L858 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-02-20 17:44:35,236 INFO L854 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~a~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| (+ 1 .cse0)) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 .cse0) |ULTIMATE.start_main_~s~0#1|))) [2022-02-20 17:44:35,236 INFO L858 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-02-20 17:44:35,236 INFO L854 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~a~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| (+ 1 .cse0)) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 .cse0) |ULTIMATE.start_main_~s~0#1|))) [2022-02-20 17:44:35,236 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:44:35,236 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:44:35,237 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:44:35,237 INFO L854 garLoopResultBuilder]: At program point L30-2(lines 30 42) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~a~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| (+ 1 .cse0)) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 .cse0) |ULTIMATE.start_main_~s~0#1|))) [2022-02-20 17:44:35,237 INFO L854 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~a~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| (+ 1 .cse0)) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 .cse0) |ULTIMATE.start_main_~s~0#1|))) [2022-02-20 17:44:35,237 INFO L854 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (let ((.cse0 (* 2 |ULTIMATE.start_main_~a~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| (+ 1 .cse0)) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 .cse0) |ULTIMATE.start_main_~s~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))) [2022-02-20 17:44:35,237 INFO L858 garLoopResultBuilder]: For program point L8(lines 8 10) no Hoare annotation was computed. [2022-02-20 17:44:35,237 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-02-20 17:44:35,238 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-02-20 17:44:35,238 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-02-20 17:44:35,238 INFO L858 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-02-20 17:44:35,238 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-02-20 17:44:35,238 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-02-20 17:44:35,241 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-02-20 17:44:35,242 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:44:35,245 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:44:35,246 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:44:35,246 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:44:35,246 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:44:35,246 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:44:35,246 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 17:44:35,246 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 17:44:35,246 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:44:35,246 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:44:35,247 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 17:44:35,247 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-02-20 17:44:35,247 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:35,247 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:35,247 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:35,247 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:35,247 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:35,247 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:35,249 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 17:44:35,249 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 17:44:35,249 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 17:44:35,249 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 17:44:35,249 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 17:44:35,250 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:44:35,250 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:44:35,250 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:44:35,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:44:35 BoogieIcfgContainer [2022-02-20 17:44:35,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:44:35,258 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:44:35,258 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:44:35,258 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:44:35,259 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:44:30" (3/4) ... [2022-02-20 17:44:35,261 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:44:35,266 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:44:35,269 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 17:44:35,269 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:44:35,269 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:44:35,270 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:44:35,295 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:44:35,295 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:44:35,296 INFO L158 Benchmark]: Toolchain (without parser) took 5204.56ms. Allocated memory was 86.0MB in the beginning and 134.2MB in the end (delta: 48.2MB). Free memory was 50.7MB in the beginning and 99.2MB in the end (delta: -48.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:44:35,297 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 86.0MB. Free memory was 66.9MB in the beginning and 66.9MB in the end (delta: 46.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:44:35,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.92ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 50.5MB in the beginning and 87.9MB in the end (delta: -37.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-02-20 17:44:35,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.96ms. Allocated memory is still 111.1MB. Free memory was 87.9MB in the beginning and 86.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:44:35,297 INFO L158 Benchmark]: Boogie Preprocessor took 14.83ms. Allocated memory is still 111.1MB. Free memory was 86.2MB in the beginning and 85.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:44:35,298 INFO L158 Benchmark]: RCFGBuilder took 218.60ms. Allocated memory is still 111.1MB. Free memory was 85.2MB in the beginning and 75.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:44:35,298 INFO L158 Benchmark]: TraceAbstraction took 4666.27ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 74.5MB in the beginning and 101.2MB in the end (delta: -26.7MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. [2022-02-20 17:44:35,298 INFO L158 Benchmark]: Witness Printer took 37.30ms. Allocated memory is still 134.2MB. Free memory was 101.2MB in the beginning and 99.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:44:35,300 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 86.0MB. Free memory was 66.9MB in the beginning and 66.9MB in the end (delta: 46.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.92ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 50.5MB in the beginning and 87.9MB in the end (delta: -37.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.96ms. Allocated memory is still 111.1MB. Free memory was 87.9MB in the beginning and 86.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.83ms. Allocated memory is still 111.1MB. Free memory was 86.2MB in the beginning and 85.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 218.60ms. Allocated memory is still 111.1MB. Free memory was 85.2MB in the beginning and 75.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4666.27ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 74.5MB in the beginning and 101.2MB in the end (delta: -26.7MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. * Witness Printer took 37.30ms. Allocated memory is still 134.2MB. Free memory was 101.2MB in the beginning and 99.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 398 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 263 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 135 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 32 PreInvPairs, 54 NumberOfFragments, 136 HoareAnnotationTreeSize, 32 FomulaSimplifications, 5 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 451 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 513 SizeOfPredicates, 5 NumberOfNonLiveVariables, 298 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 112/120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: t == 1 + 2 * a && a * a + 1 + 2 * a == s - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:44:35,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE