./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound10.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/fermat2-ll_valuebound10.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 6c4c876bf3d38b01f54a088b76131bc8275dc44ae3ac622f7c3187fe3c7bf156 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:25:15,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:25:15,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:25:15,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:25:15,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:25:15,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:25:15,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:25:15,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:25:15,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:25:15,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:25:15,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:25:15,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:25:15,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:25:15,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:25:15,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:25:15,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:25:15,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:25:15,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:25:15,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:25:15,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:25:15,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:25:15,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:25:15,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:25:15,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:25:15,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:25:15,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:25:15,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:25:15,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:25:15,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:25:15,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:25:15,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:25:15,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:25:15,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:25:15,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:25:15,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:25:15,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:25:15,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:25:15,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:25:15,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:25:15,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:25:15,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:25:15,376 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:25:15,402 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:25:15,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:25:15,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:25:15,403 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:25:15,403 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:25:15,404 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:25:15,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:25:15,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:25:15,405 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:25:15,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:25:15,406 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:25:15,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:25:15,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:25:15,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:25:15,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:25:15,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:25:15,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:25:15,407 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:25:15,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:25:15,408 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:25:15,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:25:15,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:25:15,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:25:15,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:25:15,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:25:15,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:25:15,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:25:15,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:25:15,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:25:15,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:25:15,410 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:25:15,411 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:25:15,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:25:15,411 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 -> 6c4c876bf3d38b01f54a088b76131bc8275dc44ae3ac622f7c3187fe3c7bf156 [2022-02-20 17:25:15,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:25:15,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:25:15,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:25:15,703 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:25:15,704 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:25:15,704 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound10.c [2022-02-20 17:25:15,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb797c1af/dd3024629e3b487c9e0d08d77025d704/FLAG11ab98b7b [2022-02-20 17:25:16,173 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:25:16,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound10.c [2022-02-20 17:25:16,179 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb797c1af/dd3024629e3b487c9e0d08d77025d704/FLAG11ab98b7b [2022-02-20 17:25:16,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb797c1af/dd3024629e3b487c9e0d08d77025d704 [2022-02-20 17:25:16,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:25:16,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:25:16,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:25:16,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:25:16,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:25:16,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:25:16" (1/1) ... [2022-02-20 17:25:16,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d30347b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:16, skipping insertion in model container [2022-02-20 17:25:16,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:25:16" (1/1) ... [2022-02-20 17:25:16,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:25:16,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:25:16,388 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/fermat2-ll_valuebound10.c[524,537] [2022-02-20 17:25:16,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:25:16,429 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:25:16,442 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/fermat2-ll_valuebound10.c[524,537] [2022-02-20 17:25:16,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:25:16,476 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:25:16,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:16 WrapperNode [2022-02-20 17:25:16,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:25:16,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:25:16,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:25:16,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:25:16,483 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:25:16" (1/1) ... [2022-02-20 17:25:16,489 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:25:16" (1/1) ... [2022-02-20 17:25:16,513 INFO L137 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2022-02-20 17:25:16,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:25:16,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:25:16,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:25:16,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:25:16,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:16" (1/1) ... [2022-02-20 17:25:16,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:16" (1/1) ... [2022-02-20 17:25:16,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:16" (1/1) ... [2022-02-20 17:25:16,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:16" (1/1) ... [2022-02-20 17:25:16,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:16" (1/1) ... [2022-02-20 17:25:16,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:16" (1/1) ... [2022-02-20 17:25:16,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:16" (1/1) ... [2022-02-20 17:25:16,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:25:16,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:25:16,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:25:16,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:25:16,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:16" (1/1) ... [2022-02-20 17:25:16,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:25:16,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:16,583 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:25:16,584 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:25:16,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:25:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:25:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:25:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:25:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:25:16,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:25:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:25:16,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:25:16,659 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:25:16,661 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:25:16,801 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:25:16,807 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:25:16,807 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:25:16,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:25:16 BoogieIcfgContainer [2022-02-20 17:25:16,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:25:16,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:25:16,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:25:16,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:25:16,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:25:16" (1/3) ... [2022-02-20 17:25:16,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3385976d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:25:16, skipping insertion in model container [2022-02-20 17:25:16,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:16" (2/3) ... [2022-02-20 17:25:16,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3385976d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:25:16, skipping insertion in model container [2022-02-20 17:25:16,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:25:16" (3/3) ... [2022-02-20 17:25:16,815 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_valuebound10.c [2022-02-20 17:25:16,819 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:25:16,819 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:25:16,868 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:25:16,874 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:25:16,874 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:25:16,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:25:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:25:16,893 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:16,894 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:16,894 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:16,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:16,898 INFO L85 PathProgramCache]: Analyzing trace with hash 970763787, now seen corresponding path program 1 times [2022-02-20 17:25:16,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:16,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293007558] [2022-02-20 17:25:16,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:16,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:17,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:25:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:17,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:25:17,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:25:17,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:25:17,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {30#true} #58#return; {31#false} is VALID [2022-02-20 17:25:17,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:25:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:17,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:25:17,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:25:17,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:25:17,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {31#false} #60#return; {31#false} is VALID [2022-02-20 17:25:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:25:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:17,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:25:17,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:25:17,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:25:17,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {31#false} #62#return; {31#false} is VALID [2022-02-20 17:25:17,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 17:25:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:17,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:25:17,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:25:17,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:25:17,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {31#false} #64#return; {31#false} is VALID [2022-02-20 17:25:17,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#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(13, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-02-20 17:25:17,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {30#true} is VALID [2022-02-20 17:25:17,181 INFO L272 TraceCheckUtils]: 2: Hoare triple {30#true} call assume_abort_if_not((if main_~A~0#1 >= 0 && main_~A~0#1 <= 10 then 1 else 0)); {30#true} is VALID [2022-02-20 17:25:17,181 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:25:17,181 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:25:17,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:25:17,182 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {31#false} {30#true} #58#return; {31#false} is VALID [2022-02-20 17:25:17,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {31#false} is VALID [2022-02-20 17:25:17,182 INFO L272 TraceCheckUtils]: 8: Hoare triple {31#false} call assume_abort_if_not((if main_~R~0#1 >= 0 && main_~R~0#1 <= 10 then 1 else 0)); {30#true} is VALID [2022-02-20 17:25:17,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:25:17,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:25:17,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:25:17,184 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {31#false} {31#false} #60#return; {31#false} is VALID [2022-02-20 17:25:17,184 INFO L272 TraceCheckUtils]: 13: Hoare triple {31#false} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {30#true} is VALID [2022-02-20 17:25:17,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:25:17,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:25:17,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:25:17,185 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {31#false} {31#false} #62#return; {31#false} is VALID [2022-02-20 17:25:17,185 INFO L272 TraceCheckUtils]: 18: Hoare triple {31#false} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {30#true} is VALID [2022-02-20 17:25:17,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:25:17,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:25:17,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:25:17,187 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {31#false} {31#false} #64#return; {31#false} is VALID [2022-02-20 17:25:17,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {31#false} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {31#false} is VALID [2022-02-20 17:25:17,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 17:25:17,187 INFO L272 TraceCheckUtils]: 25: Hoare triple {31#false} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {31#false} is VALID [2022-02-20 17:25:17,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2022-02-20 17:25:17,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2022-02-20 17:25:17,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 17:25:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:25:17,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:25:17,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293007558] [2022-02-20 17:25:17,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293007558] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:25:17,190 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:25:17,190 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:25:17,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628087501] [2022-02-20 17:25:17,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:25:17,196 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-02-20 17:25:17,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:17,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:25:17,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:17,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:25:17,226 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:25:17,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:25:17,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:25:17,248 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:25:17,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:17,327 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2022-02-20 17:25:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:25:17,327 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-02-20 17:25:17,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:25:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 17:25:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:25:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 17:25:17,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2022-02-20 17:25:17,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:17,470 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:25:17,473 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:25:17,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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:25:17,478 INFO L933 BasicCegarLoop]: 32 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, 32 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:25:17,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:25:17,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:25:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:25:17,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:17,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:25:17,510 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:25:17,510 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:25:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:17,515 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-20 17:25:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-20 17:25:17,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:17,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:17,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 23 states. [2022-02-20 17:25:17,517 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 23 states. [2022-02-20 17:25:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:17,522 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-20 17:25:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-20 17:25:17,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:17,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:17,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:17,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:25:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-02-20 17:25:17,527 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 29 [2022-02-20 17:25:17,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:17,528 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-02-20 17:25:17,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:25:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-20 17:25:17,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:25:17,530 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:17,530 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:17,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:25:17,531 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:17,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:17,533 INFO L85 PathProgramCache]: Analyzing trace with hash -908690225, now seen corresponding path program 1 times [2022-02-20 17:25:17,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:17,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294227104] [2022-02-20 17:25:17,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:17,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:17,574 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:25:17,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1372219447] [2022-02-20 17:25:17,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:17,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:17,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:17,577 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:25:17,579 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:25:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:17,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:25:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:17,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:18,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#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(13, 2);call #Ultimate.allocInit(12, 3); {198#true} is VALID [2022-02-20 17:25:18,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {198#true} is VALID [2022-02-20 17:25:18,053 INFO L272 TraceCheckUtils]: 2: Hoare triple {198#true} call assume_abort_if_not((if main_~A~0#1 >= 0 && main_~A~0#1 <= 10 then 1 else 0)); {198#true} is VALID [2022-02-20 17:25:18,053 INFO L290 TraceCheckUtils]: 3: Hoare triple {198#true} ~cond := #in~cond; {198#true} is VALID [2022-02-20 17:25:18,053 INFO L290 TraceCheckUtils]: 4: Hoare triple {198#true} assume !(0 == ~cond); {198#true} is VALID [2022-02-20 17:25:18,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#true} assume true; {198#true} is VALID [2022-02-20 17:25:18,054 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {198#true} {198#true} #58#return; {198#true} is VALID [2022-02-20 17:25:18,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {198#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {198#true} is VALID [2022-02-20 17:25:18,054 INFO L272 TraceCheckUtils]: 8: Hoare triple {198#true} call assume_abort_if_not((if main_~R~0#1 >= 0 && main_~R~0#1 <= 10 then 1 else 0)); {198#true} is VALID [2022-02-20 17:25:18,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {198#true} ~cond := #in~cond; {198#true} is VALID [2022-02-20 17:25:18,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {198#true} assume !(0 == ~cond); {198#true} is VALID [2022-02-20 17:25:18,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2022-02-20 17:25:18,055 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {198#true} {198#true} #60#return; {198#true} is VALID [2022-02-20 17:25:18,055 INFO L272 TraceCheckUtils]: 13: Hoare triple {198#true} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {198#true} is VALID [2022-02-20 17:25:18,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {198#true} ~cond := #in~cond; {198#true} is VALID [2022-02-20 17:25:18,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {198#true} assume !(0 == ~cond); {198#true} is VALID [2022-02-20 17:25:18,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {198#true} assume true; {198#true} is VALID [2022-02-20 17:25:18,056 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {198#true} {198#true} #62#return; {198#true} is VALID [2022-02-20 17:25:18,056 INFO L272 TraceCheckUtils]: 18: Hoare triple {198#true} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {198#true} is VALID [2022-02-20 17:25:18,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {198#true} ~cond := #in~cond; {198#true} is VALID [2022-02-20 17:25:18,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {198#true} assume !(0 == ~cond); {198#true} is VALID [2022-02-20 17:25:18,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {198#true} assume true; {198#true} is VALID [2022-02-20 17:25:18,057 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {198#true} {198#true} #64#return; {198#true} is VALID [2022-02-20 17:25:20,068 WARN L290 TraceCheckUtils]: 23: Hoare triple {198#true} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {272#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} is UNKNOWN [2022-02-20 17:25:20,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {272#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} assume !false; {272#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:25:20,501 INFO L272 TraceCheckUtils]: 25: Hoare triple {272#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {279#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:25:20,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {279#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:25:20,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {199#false} is VALID [2022-02-20 17:25:20,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {199#false} assume !false; {199#false} is VALID [2022-02-20 17:25:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:25:20,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:25:20,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:25:20,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294227104] [2022-02-20 17:25:20,504 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:25:20,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372219447] [2022-02-20 17:25:20,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372219447] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:25:20,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:25:20,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:25:20,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792577551] [2022-02-20 17:25:20,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:25:20,506 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-02-20 17:25:20,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:20,507 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:25:21,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:21,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:25:21,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:25:21,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:25:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:25:21,780 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:25:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:23,204 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-02-20 17:25:23,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:25:23,205 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-02-20 17:25:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:23,205 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:25:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 17:25:23,207 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:25:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 17:25:23,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 17:25:26,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:26,605 INFO L225 Difference]: With dead ends: 34 [2022-02-20 17:25:26,605 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 17:25:26,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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:25:26,606 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:26,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 17:25:26,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 17:25:26,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-02-20 17:25:26,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:26,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:25:26,616 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:25:26,617 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:25:26,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:26,619 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-02-20 17:25:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-02-20 17:25:26,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:26,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:26,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-02-20 17:25:26,620 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-02-20 17:25:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:26,622 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-02-20 17:25:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-02-20 17:25:26,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:26,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:26,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:26,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:25:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-02-20 17:25:26,626 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2022-02-20 17:25:26,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:26,626 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-02-20 17:25:26,626 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:25:26,626 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-20 17:25:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 17:25:26,627 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:26,628 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:26,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:25:26,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:26,828 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:26,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:26,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1577016431, now seen corresponding path program 1 times [2022-02-20 17:25:26,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:26,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471400763] [2022-02-20 17:25:26,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:26,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:26,848 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:25:26,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718279929] [2022-02-20 17:25:26,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:26,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:26,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:26,850 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:25:26,857 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:25:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:26,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 17:25:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:26,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:27,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {445#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(13, 2);call #Ultimate.allocInit(12, 3); {445#true} is VALID [2022-02-20 17:25:27,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {445#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {445#true} is VALID [2022-02-20 17:25:27,167 INFO L272 TraceCheckUtils]: 2: Hoare triple {445#true} call assume_abort_if_not((if main_~A~0#1 >= 0 && main_~A~0#1 <= 10 then 1 else 0)); {445#true} is VALID [2022-02-20 17:25:27,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {445#true} ~cond := #in~cond; {445#true} is VALID [2022-02-20 17:25:27,168 INFO L290 TraceCheckUtils]: 4: Hoare triple {445#true} assume !(0 == ~cond); {445#true} is VALID [2022-02-20 17:25:27,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {445#true} assume true; {445#true} is VALID [2022-02-20 17:25:27,168 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {445#true} {445#true} #58#return; {445#true} is VALID [2022-02-20 17:25:27,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {445#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {445#true} is VALID [2022-02-20 17:25:27,169 INFO L272 TraceCheckUtils]: 8: Hoare triple {445#true} call assume_abort_if_not((if main_~R~0#1 >= 0 && main_~R~0#1 <= 10 then 1 else 0)); {445#true} is VALID [2022-02-20 17:25:27,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {445#true} ~cond := #in~cond; {445#true} is VALID [2022-02-20 17:25:27,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {445#true} assume !(0 == ~cond); {445#true} is VALID [2022-02-20 17:25:27,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {445#true} assume true; {445#true} is VALID [2022-02-20 17:25:27,170 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {445#true} {445#true} #60#return; {445#true} is VALID [2022-02-20 17:25:27,170 INFO L272 TraceCheckUtils]: 13: Hoare triple {445#true} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {445#true} is VALID [2022-02-20 17:25:27,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {445#true} ~cond := #in~cond; {445#true} is VALID [2022-02-20 17:25:27,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {445#true} assume !(0 == ~cond); {445#true} is VALID [2022-02-20 17:25:27,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {445#true} assume true; {445#true} is VALID [2022-02-20 17:25:27,171 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {445#true} {445#true} #62#return; {445#true} is VALID [2022-02-20 17:25:27,171 INFO L272 TraceCheckUtils]: 18: Hoare triple {445#true} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {445#true} is VALID [2022-02-20 17:25:27,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {445#true} ~cond := #in~cond; {445#true} is VALID [2022-02-20 17:25:27,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {445#true} assume !(0 == ~cond); {445#true} is VALID [2022-02-20 17:25:27,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {445#true} assume true; {445#true} is VALID [2022-02-20 17:25:27,172 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {445#true} {445#true} #64#return; {445#true} is VALID [2022-02-20 17:25:27,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {445#true} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {445#true} is VALID [2022-02-20 17:25:27,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {445#true} assume !false; {445#true} is VALID [2022-02-20 17:25:27,173 INFO L272 TraceCheckUtils]: 25: Hoare triple {445#true} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {445#true} is VALID [2022-02-20 17:25:27,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {445#true} ~cond := #in~cond; {528#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:25:27,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {528#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:25:27,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {532#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:25:27,180 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {532#(not (= |__VERIFIER_assert_#in~cond| 0))} {445#true} #66#return; {539#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~r~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} is VALID [2022-02-20 17:25:27,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {539#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~r~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} assume !(0 != main_~r~0#1); {543#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} is VALID [2022-02-20 17:25:27,182 INFO L272 TraceCheckUtils]: 31: Hoare triple {543#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {547#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:25:27,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {547#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {551#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:25:27,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {551#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {446#false} is VALID [2022-02-20 17:25:27,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {446#false} assume !false; {446#false} is VALID [2022-02-20 17:25:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:25:27,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:25:27,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {446#false} assume !false; {446#false} is VALID [2022-02-20 17:25:27,664 INFO L290 TraceCheckUtils]: 33: Hoare triple {551#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {446#false} is VALID [2022-02-20 17:25:27,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {547#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {551#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:25:27,666 INFO L272 TraceCheckUtils]: 31: Hoare triple {543#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {547#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:25:27,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {570#(or (not (= |ULTIMATE.start_main_~r~0#1| 0)) (= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|))))} assume !(0 != main_~r~0#1); {543#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} is VALID [2022-02-20 17:25:27,668 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {532#(not (= |__VERIFIER_assert_#in~cond| 0))} {445#true} #66#return; {570#(or (not (= |ULTIMATE.start_main_~r~0#1| 0)) (= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|))))} is VALID [2022-02-20 17:25:27,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {532#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:25:27,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {583#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:25:27,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {445#true} ~cond := #in~cond; {583#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:25:27,679 INFO L272 TraceCheckUtils]: 25: Hoare triple {445#true} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {445#true} is VALID [2022-02-20 17:25:27,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {445#true} assume !false; {445#true} is VALID [2022-02-20 17:25:27,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {445#true} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {445#true} is VALID [2022-02-20 17:25:27,680 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {445#true} {445#true} #64#return; {445#true} is VALID [2022-02-20 17:25:27,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {445#true} assume true; {445#true} is VALID [2022-02-20 17:25:27,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {445#true} assume !(0 == ~cond); {445#true} is VALID [2022-02-20 17:25:27,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {445#true} ~cond := #in~cond; {445#true} is VALID [2022-02-20 17:25:27,681 INFO L272 TraceCheckUtils]: 18: Hoare triple {445#true} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {445#true} is VALID [2022-02-20 17:25:27,681 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {445#true} {445#true} #62#return; {445#true} is VALID [2022-02-20 17:25:27,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {445#true} assume true; {445#true} is VALID [2022-02-20 17:25:27,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {445#true} assume !(0 == ~cond); {445#true} is VALID [2022-02-20 17:25:27,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {445#true} ~cond := #in~cond; {445#true} is VALID [2022-02-20 17:25:27,682 INFO L272 TraceCheckUtils]: 13: Hoare triple {445#true} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {445#true} is VALID [2022-02-20 17:25:27,682 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {445#true} {445#true} #60#return; {445#true} is VALID [2022-02-20 17:25:27,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {445#true} assume true; {445#true} is VALID [2022-02-20 17:25:27,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {445#true} assume !(0 == ~cond); {445#true} is VALID [2022-02-20 17:25:27,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {445#true} ~cond := #in~cond; {445#true} is VALID [2022-02-20 17:25:27,682 INFO L272 TraceCheckUtils]: 8: Hoare triple {445#true} call assume_abort_if_not((if main_~R~0#1 >= 0 && main_~R~0#1 <= 10 then 1 else 0)); {445#true} is VALID [2022-02-20 17:25:27,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {445#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {445#true} is VALID [2022-02-20 17:25:27,683 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {445#true} {445#true} #58#return; {445#true} is VALID [2022-02-20 17:25:27,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {445#true} assume true; {445#true} is VALID [2022-02-20 17:25:27,683 INFO L290 TraceCheckUtils]: 4: Hoare triple {445#true} assume !(0 == ~cond); {445#true} is VALID [2022-02-20 17:25:27,683 INFO L290 TraceCheckUtils]: 3: Hoare triple {445#true} ~cond := #in~cond; {445#true} is VALID [2022-02-20 17:25:27,683 INFO L272 TraceCheckUtils]: 2: Hoare triple {445#true} call assume_abort_if_not((if main_~A~0#1 >= 0 && main_~A~0#1 <= 10 then 1 else 0)); {445#true} is VALID [2022-02-20 17:25:27,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {445#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {445#true} is VALID [2022-02-20 17:25:27,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {445#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(13, 2);call #Ultimate.allocInit(12, 3); {445#true} is VALID [2022-02-20 17:25:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:25:27,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:25:27,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471400763] [2022-02-20 17:25:27,686 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:25:27,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718279929] [2022-02-20 17:25:27,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718279929] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:25:27,686 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:25:27,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-02-20 17:25:27,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241067017] [2022-02-20 17:25:27,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:25:27,687 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 35 [2022-02-20 17:25:27,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:27,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:25:27,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:27,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:25:27,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:25:27,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:25:27,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:25:27,718 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:25:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:27,925 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-20 17:25:27,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:25:27,925 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 35 [2022-02-20 17:25:27,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:25:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-02-20 17:25:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:25:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-02-20 17:25:27,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-02-20 17:25:27,965 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:25:27,965 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:25:27,965 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:25:27,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:25:27,967 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:27,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 70 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:25:27,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:25:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:25:27,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:27,969 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:25:27,969 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:25:27,969 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:25:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:27,969 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:25:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:25:27,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:27,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:27,970 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:25:27,970 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:25:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:27,970 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:25:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:25:27,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:27,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:27,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:27,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:27,971 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:25:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:25:27,971 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-02-20 17:25:27,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:27,971 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:25:27,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:25:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:25:27,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:27,973 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:25:27,992 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:25:28,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:25:28,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:25:28,206 INFO L854 garLoopResultBuilder]: At program point L35-2(lines 35 46) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~A~0#1| 4)) (.cse1 (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|)) (.cse2 (* 2 |ULTIMATE.start_main_~u~0#1|)) (.cse3 (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))) (and (= (+ .cse0 (* |ULTIMATE.start_main_~r~0#1| 4) .cse1 .cse2) .cse3) (= (+ .cse0 .cse1 .cse2) .cse3))) [2022-02-20 17:25:28,206 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:25:28,206 INFO L858 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-02-20 17:25:28,207 INFO L861 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-02-20 17:25:28,207 INFO L861 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-02-20 17:25:28,207 INFO L861 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: true [2022-02-20 17:25:28,207 INFO L861 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-02-20 17:25:28,207 INFO L858 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2022-02-20 17:25:28,207 INFO L861 garLoopResultBuilder]: At program point L50(lines 19 51) the Hoare annotation is: true [2022-02-20 17:25:28,207 INFO L854 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~r~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|))) [2022-02-20 17:25:28,207 INFO L858 garLoopResultBuilder]: For program point L36-1(lines 35 46) no Hoare annotation was computed. [2022-02-20 17:25:28,207 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:25:28,207 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:25:28,207 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:25:28,208 INFO L858 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-02-20 17:25:28,208 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 45) no Hoare annotation was computed. [2022-02-20 17:25:28,208 INFO L854 garLoopResultBuilder]: At program point L39-2(lines 35 46) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~r~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|))) [2022-02-20 17:25:28,208 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-02-20 17:25:28,208 INFO L858 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-02-20 17:25:28,208 INFO L858 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-02-20 17:25:28,208 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-02-20 17:25:28,208 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-02-20 17:25:28,208 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-02-20 17:25:28,208 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-02-20 17:25:28,208 INFO L858 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-02-20 17:25:28,208 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-02-20 17:25:28,209 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-02-20 17:25:28,211 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 17:25:28,212 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:25:28,215 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:25:28,215 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 17:25:28,215 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:25:28,215 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:25:28,215 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 17:25:28,216 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 17:25:28,216 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:25:28,216 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:25:28,216 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 17:25:28,216 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-02-20 17:25:28,216 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:25:28,216 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:25:28,216 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 17:25:28,216 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 17:25:28,216 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:25:28,216 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:25:28,216 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:25:28,216 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:25:28,216 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:25:28,216 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:25:28,217 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 17:25:28,217 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 17:25:28,217 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-02-20 17:25:28,217 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-02-20 17:25:28,217 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 17:25:28,218 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 17:25:28,218 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 17:25:28,218 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 17:25:28,218 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:25:28,218 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-02-20 17:25:28,218 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:25:28,219 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:25:28,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:25:28 BoogieIcfgContainer [2022-02-20 17:25:28,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:25:28,226 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:25:28,226 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:25:28,226 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:25:28,226 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:25:16" (3/4) ... [2022-02-20 17:25:28,228 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:25:28,234 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 17:25:28,234 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:25:28,237 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 17:25:28,237 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:25:28,237 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:25:28,238 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:25:28,263 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:25:28,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:25:28,264 INFO L158 Benchmark]: Toolchain (without parser) took 12061.88ms. Allocated memory was 81.8MB in the beginning and 146.8MB in the end (delta: 65.0MB). Free memory was 47.2MB in the beginning and 82.1MB in the end (delta: -34.9MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2022-02-20 17:25:28,264 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:25:28,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.39ms. Allocated memory was 81.8MB in the beginning and 102.8MB in the end (delta: 21.0MB). Free memory was 47.0MB in the beginning and 77.8MB in the end (delta: -30.8MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2022-02-20 17:25:28,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.66ms. Allocated memory is still 102.8MB. Free memory was 77.6MB in the beginning and 76.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:25:28,265 INFO L158 Benchmark]: Boogie Preprocessor took 32.86ms. Allocated memory is still 102.8MB. Free memory was 76.0MB in the beginning and 75.0MB in the end (delta: 964.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:25:28,265 INFO L158 Benchmark]: RCFGBuilder took 260.41ms. Allocated memory is still 102.8MB. Free memory was 74.8MB in the beginning and 63.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:25:28,266 INFO L158 Benchmark]: TraceAbstraction took 11415.38ms. Allocated memory was 102.8MB in the beginning and 146.8MB in the end (delta: 44.0MB). Free memory was 63.2MB in the beginning and 84.2MB in the end (delta: -21.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-02-20 17:25:28,266 INFO L158 Benchmark]: Witness Printer took 37.03ms. Allocated memory is still 146.8MB. Free memory was 84.2MB in the beginning and 82.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:25:28,268 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.18ms. Allocated memory is still 81.8MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.39ms. Allocated memory was 81.8MB in the beginning and 102.8MB in the end (delta: 21.0MB). Free memory was 47.0MB in the beginning and 77.8MB in the end (delta: -30.8MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.66ms. Allocated memory is still 102.8MB. Free memory was 77.6MB in the beginning and 76.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.86ms. Allocated memory is still 102.8MB. Free memory was 76.0MB in the beginning and 75.0MB in the end (delta: 964.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 260.41ms. Allocated memory is still 102.8MB. Free memory was 74.8MB in the beginning and 63.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11415.38ms. Allocated memory was 102.8MB in the beginning and 146.8MB in the end (delta: 44.0MB). Free memory was 63.2MB in the beginning and 84.2MB in the end (delta: -21.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Witness Printer took 37.03ms. Allocated memory is still 146.8MB. Free memory was 84.2MB in the beginning and 82.1MB 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 3 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 186 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 73 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=2, InterpolantAutomatonStates: 13, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 20 PreInvPairs, 29 NumberOfFragments, 89 HoareAnnotationTreeSize, 20 FomulaSimplifications, 100 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 287 SizeOfPredicates, 9 NumberOfNonLiveVariables, 177 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 98/100 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: 35]: Loop Invariant Derived loop invariant: A * 4 + r * 4 + v * v + 2 * u == 2 * v + u * u - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:25:28,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE