/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:18:33,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:18:33,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:18:33,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:18:33,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:18:33,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:18:33,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:18:33,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:18:33,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:18:33,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:18:33,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:18:33,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:18:33,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:18:33,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:18:33,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:18:33,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:18:33,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:18:33,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:18:33,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:18:33,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:18:33,388 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:18:33,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:18:33,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:18:33,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:18:33,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:18:33,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:18:33,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:18:33,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:18:33,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:18:33,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:18:33,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:18:33,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:18:33,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:18:33,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:18:33,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:18:33,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:18:33,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:18:33,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:18:33,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:18:33,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:18:33,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:18:33,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:18:33,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:18:33,447 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:18:33,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:18:33,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:18:33,448 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:18:33,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:18:33,449 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:18:33,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:18:33,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:18:33,450 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:18:33,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:18:33,451 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:18:33,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:18:33,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:18:33,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:18:33,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:18:33,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:18:33,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:18:33,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:18:33,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:18:33,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:18:33,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:18:33,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:18:33,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:18:33,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:18:33,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:18:33,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:18:33,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:18:33,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:18:33,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:18:33,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:18:33,454 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:18:33,455 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:18:33,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:18:33,455 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:18:33,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:18:33,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:18:33,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:18:33,667 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:18:33,668 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:18:33,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound2.c [2022-04-27 13:18:33,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb710d4d4/2503e7e2b3ab447a9f5675508ce6364f/FLAGc4138898d [2022-04-27 13:18:34,130 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:18:34,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound2.c [2022-04-27 13:18:34,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb710d4d4/2503e7e2b3ab447a9f5675508ce6364f/FLAGc4138898d [2022-04-27 13:18:34,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb710d4d4/2503e7e2b3ab447a9f5675508ce6364f [2022-04-27 13:18:34,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:18:34,551 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:18:34,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:18:34,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:18:34,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:18:34,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:18:34" (1/1) ... [2022-04-27 13:18:34,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@414fd419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:34, skipping insertion in model container [2022-04-27 13:18:34,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:18:34" (1/1) ... [2022-04-27 13:18:34,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:18:34,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:18:34,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound2.c[524,537] [2022-04-27 13:18:34,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:18:34,743 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:18:34,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound2.c[524,537] [2022-04-27 13:18:34,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:18:34,770 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:18:34,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:34 WrapperNode [2022-04-27 13:18:34,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:18:34,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:18:34,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:18:34,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:18:34,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:34" (1/1) ... [2022-04-27 13:18:34,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:34" (1/1) ... [2022-04-27 13:18:34,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:34" (1/1) ... [2022-04-27 13:18:34,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:34" (1/1) ... [2022-04-27 13:18:34,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:34" (1/1) ... [2022-04-27 13:18:34,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:34" (1/1) ... [2022-04-27 13:18:34,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:34" (1/1) ... [2022-04-27 13:18:34,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:18:34,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:18:34,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:18:34,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:18:34,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:34" (1/1) ... [2022-04-27 13:18:34,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:18:34,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:34,835 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-04-27 13:18:34,837 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-04-27 13:18:34,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:18:34,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:18:34,862 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:18:34,862 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:18:34,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:18:34,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:18:34,863 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:18:34,863 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:18:34,863 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:18:34,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:18:34,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:18:34,863 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:18:34,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:18:34,863 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:18:34,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:18:34,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:18:34,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:18:34,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:18:34,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:18:34,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:18:34,913 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:18:34,914 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:18:35,090 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:18:35,112 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:18:35,112 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 13:18:35,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:18:35 BoogieIcfgContainer [2022-04-27 13:18:35,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:18:35,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:18:35,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:18:35,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:18:35,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:18:34" (1/3) ... [2022-04-27 13:18:35,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23df5995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:18:35, skipping insertion in model container [2022-04-27 13:18:35,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:34" (2/3) ... [2022-04-27 13:18:35,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23df5995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:18:35, skipping insertion in model container [2022-04-27 13:18:35,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:18:35" (3/3) ... [2022-04-27 13:18:35,120 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_valuebound2.c [2022-04-27 13:18:35,146 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:18:35,146 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:18:35,215 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:18:35,221 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@352bbb9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b4b7361 [2022-04-27 13:18:35,221 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:18:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:18:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:18:35,249 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:35,259 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:35,260 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:35,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:35,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1790211013, now seen corresponding path program 1 times [2022-04-27 13:18:35,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:35,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652922683] [2022-04-27 13:18:35,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:35,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:35,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:18:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:35,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {35#true} is VALID [2022-04-27 13:18:35,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 13:18:35,494 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID [2022-04-27 13:18:35,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:18:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:35,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:35,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:35,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:35,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 13:18:35,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:18:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:35,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:35,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:35,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:35,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 13:18:35,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:18:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:35,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:35,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:35,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:35,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 13:18:35,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 13:18:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:35,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:35,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:35,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:35,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID [2022-04-27 13:18:35,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:18:35,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {35#true} is VALID [2022-04-27 13:18:35,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 13:18:35,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID [2022-04-27 13:18:35,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-27 13:18:35,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-27 13:18:35,550 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 2 then 1 else 0)); {35#true} is VALID [2022-04-27 13:18:35,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:35,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:35,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:35,551 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 13:18:35,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-27 13:18:35,552 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 2 then 1 else 0)); {35#true} is VALID [2022-04-27 13:18:35,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:35,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:35,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:35,553 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 13:18:35,553 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {35#true} is VALID [2022-04-27 13:18:35,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:35,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:35,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:35,556 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 13:18:35,556 INFO L272 TraceCheckUtils]: 22: Hoare triple {36#false} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {35#true} is VALID [2022-04-27 13:18:35,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:35,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:35,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:35,558 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID [2022-04-27 13:18:35,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {36#false} is VALID [2022-04-27 13:18:35,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-04-27 13:18:35,558 INFO L272 TraceCheckUtils]: 29: Hoare triple {36#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {36#false} is VALID [2022-04-27 13:18:35,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-27 13:18:35,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-27 13:18:35,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-27 13:18:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:18:35,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:35,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652922683] [2022-04-27 13:18:35,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652922683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:18:35,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:18:35,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:18:35,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081735652] [2022-04-27 13:18:35,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:18:35,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 13:18:35,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:35,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:18:35,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:35,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:18:35,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:35,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:18:35,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:18:35,652 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:18:35,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:35,754 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2022-04-27 13:18:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:18:35,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 13:18:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:18:35,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-04-27 13:18:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:18:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-04-27 13:18:35,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 80 transitions. [2022-04-27 13:18:35,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:35,866 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:18:35,866 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 13:18:35,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:18:35,875 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:35,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:18:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 13:18:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 13:18:35,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:35,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:18:35,906 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:18:35,906 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:18:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:35,910 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-27 13:18:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-27 13:18:35,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:35,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:35,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-27 13:18:35,912 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-27 13:18:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:35,915 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-27 13:18:35,915 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-27 13:18:35,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:35,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:35,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:35,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:18:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-04-27 13:18:35,920 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 33 [2022-04-27 13:18:35,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:35,920 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-04-27 13:18:35,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:18:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-27 13:18:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:18:35,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:35,922 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:35,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:18:35,922 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:35,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:35,923 INFO L85 PathProgramCache]: Analyzing trace with hash -102231875, now seen corresponding path program 1 times [2022-04-27 13:18:35,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:35,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017731301] [2022-04-27 13:18:35,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:35,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:35,946 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:35,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1500255067] [2022-04-27 13:18:35,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:35,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:35,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:35,948 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-04-27 13:18:35,991 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-04-27 13:18:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:36,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 13:18:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:36,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:42,349 WARN L232 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 988] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-27 13:18:58,518 WARN L232 SmtUtils]: Spent 16.13s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:19:04,236 WARN L232 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 988] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-27 13:19:15,268 WARN L232 SmtUtils]: Spent 11.00s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:19:21,067 WARN L232 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 988] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-27 13:20:44,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2022-04-27 13:20:44,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#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); {231#true} is VALID [2022-04-27 13:20:44,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:20:44,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #73#return; {231#true} is VALID [2022-04-27 13:20:44,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret6 := main(); {231#true} is VALID [2022-04-27 13:20:44,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4; {231#true} is VALID [2022-04-27 13:20:44,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {231#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 2 then 1 else 0)); {231#true} is VALID [2022-04-27 13:20:44,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#true} ~cond := #in~cond; {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:20:44,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:20:44,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {261#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:20:44,412 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {261#(not (= |assume_abort_if_not_#in~cond| 0))} {231#true} #61#return; {268#(and (<= 0 main_~A~0) (<= main_~A~0 2))} is VALID [2022-04-27 13:20:44,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {268#(and (<= 0 main_~A~0) (<= main_~A~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {268#(and (<= 0 main_~A~0) (<= main_~A~0 2))} is VALID [2022-04-27 13:20:44,413 INFO L272 TraceCheckUtils]: 12: Hoare triple {268#(and (<= 0 main_~A~0) (<= main_~A~0 2))} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 2 then 1 else 0)); {231#true} is VALID [2022-04-27 13:20:44,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {231#true} ~cond := #in~cond; {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:20:44,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:20:44,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {261#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:20:44,415 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {261#(not (= |assume_abort_if_not_#in~cond| 0))} {268#(and (<= 0 main_~A~0) (<= main_~A~0 2))} #63#return; {287#(and (<= 0 main_~A~0) (<= main_~R~0 2) (<= main_~A~0 2) (<= 0 main_~R~0))} is VALID [2022-04-27 13:20:44,416 INFO L272 TraceCheckUtils]: 17: Hoare triple {287#(and (<= 0 main_~A~0) (<= main_~R~0 2) (<= main_~A~0 2) (<= 0 main_~R~0))} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {231#true} is VALID [2022-04-27 13:20:44,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {231#true} ~cond := #in~cond; {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:20:44,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:20:44,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {261#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:20:44,418 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {261#(not (= |assume_abort_if_not_#in~cond| 0))} {287#(and (<= 0 main_~A~0) (<= main_~R~0 2) (<= main_~A~0 2) (<= 0 main_~R~0))} #65#return; {303#(and (<= main_~A~0 2) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} is VALID [2022-04-27 13:20:44,418 INFO L272 TraceCheckUtils]: 22: Hoare triple {303#(and (<= main_~A~0 2) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {231#true} is VALID [2022-04-27 13:20:44,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {231#true} ~cond := #in~cond; {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:20:44,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:20:44,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {261#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:20:44,421 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {261#(not (= |assume_abort_if_not_#in~cond| 0))} {303#(and (<= main_~A~0 2) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} #67#return; {319#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1) (<= main_~A~0 2) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} is VALID [2022-04-27 13:20:44,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {319#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1) (<= main_~A~0 2) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {323#(and (<= 0 main_~A~0) (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= (mod main_~A~0 2) 1) (< (+ (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2))) 1) (+ main_~A~0 (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2))))) (<= main_~A~0 2) (= main_~v~0 1))} is VALID [2022-04-27 13:20:44,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {323#(and (<= 0 main_~A~0) (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= (mod main_~A~0 2) 1) (< (+ (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2))) 1) (+ main_~A~0 (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2))))) (<= main_~A~0 2) (= main_~v~0 1))} assume !false; {323#(and (<= 0 main_~A~0) (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= (mod main_~A~0 2) 1) (< (+ (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2))) 1) (+ main_~A~0 (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2))))) (<= main_~A~0 2) (= main_~v~0 1))} is VALID [2022-04-27 13:20:44,432 INFO L272 TraceCheckUtils]: 29: Hoare triple {323#(and (<= 0 main_~A~0) (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= (mod main_~A~0 2) 1) (< (+ (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2))) 1) (+ main_~A~0 (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2))))) (<= main_~A~0 2) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:20:44,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:20:44,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {232#false} is VALID [2022-04-27 13:20:44,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-27 13:20:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:20:44,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:20:44,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:20:44,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017731301] [2022-04-27 13:20:44,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:20:44,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500255067] [2022-04-27 13:20:44,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500255067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:20:44,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:20:44,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-27 13:20:44,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89426116] [2022-04-27 13:20:44,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:20:44,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2022-04-27 13:20:44,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:20:44,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:20:44,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:44,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 13:20:44,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:20:44,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 13:20:44,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:20:44,479 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:20:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:45,215 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-27 13:20:45,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 13:20:45,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2022-04-27 13:20:45,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:20:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:20:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-27 13:20:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:20:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-27 13:20:45,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2022-04-27 13:20:45,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:45,270 INFO L225 Difference]: With dead ends: 35 [2022-04-27 13:20:45,270 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 13:20:45,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:20:45,272 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:20:45,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 86 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 13:20:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 13:20:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 13:20:45,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:20:45,273 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-04-27 13:20:45,273 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-04-27 13:20:45,274 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-04-27 13:20:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:45,274 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:20:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:20:45,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:45,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:45,274 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-04-27 13:20:45,274 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-04-27 13:20:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:45,274 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:20:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:20:45,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:45,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:45,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:20:45,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:20:45,275 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-04-27 13:20:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 13:20:45,275 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2022-04-27 13:20:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:20:45,275 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 13:20:45,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:20:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:20:45,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:45,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:20:45,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 13:20:45,487 WARN L477 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-04-27 13:20:45,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 13:20:45,604 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 13:20:45,607 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 13:20:45,607 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 13:20:45,608 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-27 13:20:45,608 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 13:20:45,608 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 13:20:45,608 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 13:20:45,608 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 46) the Hoare annotation is: (let ((.cse1 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (let ((.cse0 (* .cse1 .cse1))) (and (= (mod (+ main_~u~0 1) 2) 0) (= (+ main_~A~0 main_~r~0) .cse0) (= (mod main_~A~0 2) 1) (< (+ .cse0 1) (+ main_~A~0 (* 2 .cse1))) (<= main_~A~0 2) (= main_~v~0 1) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2)))))) [2022-04-27 13:20:45,609 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-04-27 13:20:45,609 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= main_~A~0 2) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2)))) [2022-04-27 13:20:45,609 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (<= 0 main_~A~0) (<= main_~A~0 2)) [2022-04-27 13:20:45,609 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 51) no Hoare annotation was computed. [2022-04-27 13:20:45,609 INFO L895 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: (and (<= 0 main_~A~0) (<= main_~R~0 2) (<= main_~A~0 2) (<= 0 main_~R~0)) [2022-04-27 13:20:45,609 INFO L902 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-27 13:20:45,609 INFO L899 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2022-04-27 13:20:45,609 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 51) no Hoare annotation was computed. [2022-04-27 13:20:45,609 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse1 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (let ((.cse0 (* .cse1 .cse1))) (and (= (mod (+ main_~u~0 1) 2) 0) (= (+ main_~A~0 main_~r~0) .cse0) (= (mod main_~A~0 2) 1) (< (+ .cse0 1) (+ main_~A~0 (* 2 .cse1))) (<= main_~A~0 2) (= main_~v~0 1) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2)))))) [2022-04-27 13:20:45,609 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 35 46) no Hoare annotation was computed. [2022-04-27 13:20:45,610 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 51) the Hoare annotation is: true [2022-04-27 13:20:45,610 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-04-27 13:20:45,610 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 45) no Hoare annotation was computed. [2022-04-27 13:20:45,610 INFO L895 garLoopResultBuilder]: At program point L39-2(lines 35 46) the Hoare annotation is: (let ((.cse1 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (let ((.cse0 (* .cse1 .cse1))) (and (= (mod (+ main_~u~0 1) 2) 0) (= (+ main_~A~0 main_~r~0) .cse0) (= (mod main_~A~0 2) 1) (< (+ .cse0 1) (+ main_~A~0 (* 2 .cse1))) (<= main_~A~0 2) (= main_~v~0 1) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2)))))) [2022-04-27 13:20:45,610 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:20:45,610 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 13:20:45,610 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:20:45,610 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:20:45,610 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 13:20:45,611 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 13:20:45,611 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:20:45,611 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 13:20:45,611 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 13:20:45,611 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 13:20:45,611 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 13:20:45,611 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 13:20:45,611 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 13:20:45,613 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 13:20:45,615 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:20:45,618 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:20:45,618 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:20:45,624 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:20:45,624 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:20:45,624 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:20:45,624 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:20:45,624 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:20:45,624 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:20:45,624 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:20:45,624 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-04-27 13:20:45,624 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:20:45,624 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:20:45,624 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:20:45,625 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 13:20:45,629 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 13:20:45,629 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 13:20:45,629 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 13:20:45,629 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:20:45,629 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:20:45,629 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:20:45,629 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:20:45,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:20:45 BoogieIcfgContainer [2022-04-27 13:20:45,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:20:45,641 INFO L158 Benchmark]: Toolchain (without parser) took 131090.04ms. Allocated memory was 191.9MB in the beginning and 241.2MB in the end (delta: 49.3MB). Free memory was 140.6MB in the beginning and 86.9MB in the end (delta: 53.7MB). Peak memory consumption was 103.1MB. Max. memory is 8.0GB. [2022-04-27 13:20:45,642 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory was 157.0MB in the beginning and 157.0MB in the end (delta: 76.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:20:45,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.49ms. Allocated memory is still 191.9MB. Free memory was 140.4MB in the beginning and 165.6MB in the end (delta: -25.2MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-27 13:20:45,642 INFO L158 Benchmark]: Boogie Preprocessor took 36.26ms. Allocated memory is still 191.9MB. Free memory was 165.6MB in the beginning and 164.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 13:20:45,643 INFO L158 Benchmark]: RCFGBuilder took 305.00ms. Allocated memory is still 191.9MB. Free memory was 164.2MB in the beginning and 152.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 13:20:45,643 INFO L158 Benchmark]: TraceAbstraction took 130524.97ms. Allocated memory was 191.9MB in the beginning and 241.2MB in the end (delta: 49.3MB). Free memory was 151.9MB in the beginning and 86.9MB in the end (delta: 65.1MB). Peak memory consumption was 115.1MB. Max. memory is 8.0GB. [2022-04-27 13:20:45,645 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.12ms. Allocated memory is still 191.9MB. Free memory was 157.0MB in the beginning and 157.0MB in the end (delta: 76.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.49ms. Allocated memory is still 191.9MB. Free memory was 140.4MB in the beginning and 165.6MB in the end (delta: -25.2MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.26ms. Allocated memory is still 191.9MB. Free memory was 165.6MB in the beginning and 164.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 305.00ms. Allocated memory is still 191.9MB. Free memory was 164.2MB in the beginning and 152.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 130524.97ms. Allocated memory was 191.9MB in the beginning and 241.2MB in the end (delta: 49.3MB). Free memory was 151.9MB in the beginning and 86.9MB in the end (delta: 65.1MB). Peak memory consumption was 115.1MB. Max. memory is 8.0GB. * 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 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 130.4s, OverallIterations: 2, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112 IncrementalHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 48 mSDtfsCounter, 112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 27.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 24 PreInvPairs, 30 NumberOfFragments, 282 HoareAnnotationTreeSize, 24 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 128.6s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 308 SizeOfPredicates, 6 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 48/48 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: ((((((u + 1) % 2 == 0 && A + r == (-1 * u + 1) / -2 * ((-1 * u + 1) / -2)) && A % 2 == 1) && (-1 * u + 1) / -2 * ((-1 * u + 1) / -2) + 1 < A + 2 * ((-1 * u + 1) / -2)) && A <= 2) && v == 1) && R * R + 1 < A + R * 2 RESULT: Ultimate proved your program to be correct! [2022-04-27 13:20:45,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...