/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/fermat1-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:16:56,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:16:56,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:16:56,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:16:56,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:16:56,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:16:56,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:16:56,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:16:56,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:16:56,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:16:56,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:16:56,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:16:56,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:16:56,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:16:56,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:16:56,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:16:56,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:16:56,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:16:56,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:16:56,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:16:56,896 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:16:56,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:16:56,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:16:56,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:16:56,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:16:56,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:16:56,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:16:56,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:16:56,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:16:56,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:16:56,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:16:56,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:16:56,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:16:56,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:16:56,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:16:56,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:16:56,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:16:56,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:16:56,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:16:56,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:16:56,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:16:56,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:16:56,922 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:16:56,956 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:16:56,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:16:56,957 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:16:56,957 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:16:56,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:16:56,957 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:16:56,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:16:56,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:16:56,958 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:16:56,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:16:56,959 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:16:56,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:16:56,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:16:56,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:16:56,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:16:56,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:16:56,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:16:56,961 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:16:56,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:16:56,961 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:16:56,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:16:56,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:16:56,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:16:56,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:16:56,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:16:56,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:16:56,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:16:56,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:16:56,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:16:56,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:16:56,962 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:16:56,962 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:16:56,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:16:56,963 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:16:57,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:16:57,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:16:57,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:16:57,212 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:16:57,212 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:16:57,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_valuebound10.c [2022-04-27 13:16:57,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49577b56/48e4c4df126241aba8c808ae6bdb4625/FLAG0c4f07552 [2022-04-27 13:16:57,692 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:16:57,694 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_valuebound10.c [2022-04-27 13:16:57,703 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49577b56/48e4c4df126241aba8c808ae6bdb4625/FLAG0c4f07552 [2022-04-27 13:16:58,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49577b56/48e4c4df126241aba8c808ae6bdb4625 [2022-04-27 13:16:58,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:16:58,100 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:16:58,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:16:58,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:16:58,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:16:58,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:16:58" (1/1) ... [2022-04-27 13:16:58,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aee22c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:58, skipping insertion in model container [2022-04-27 13:16:58,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:16:58" (1/1) ... [2022-04-27 13:16:58,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:16:58,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:16:58,277 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/fermat1-ll_valuebound10.c[535,548] [2022-04-27 13:16:58,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:16:58,306 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:16:58,315 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/fermat1-ll_valuebound10.c[535,548] [2022-04-27 13:16:58,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:16:58,335 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:16:58,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:58 WrapperNode [2022-04-27 13:16:58,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:16:58,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:16:58,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:16:58,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:16:58,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:58" (1/1) ... [2022-04-27 13:16:58,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:58" (1/1) ... [2022-04-27 13:16:58,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:58" (1/1) ... [2022-04-27 13:16:58,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:58" (1/1) ... [2022-04-27 13:16:58,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:58" (1/1) ... [2022-04-27 13:16:58,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:58" (1/1) ... [2022-04-27 13:16:58,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:58" (1/1) ... [2022-04-27 13:16:58,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:16:58,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:16:58,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:16:58,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:16:58,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:58" (1/1) ... [2022-04-27 13:16:58,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:16:58,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:58,408 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:16:58,433 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:16:58,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:16:58,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:16:58,452 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:16:58,453 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:16:58,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:16:58,454 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:16:58,454 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:16:58,454 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:16:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:16:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:16:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:16:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:16:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:16:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:16:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:16:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:16:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:16:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:16:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:16:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:16:58,515 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:16:58,517 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:16:58,726 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:16:58,732 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:16:58,732 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 13:16:58,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:16:58 BoogieIcfgContainer [2022-04-27 13:16:58,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:16:58,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:16:58,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:16:58,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:16:58,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:16:58" (1/3) ... [2022-04-27 13:16:58,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3feae68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:16:58, skipping insertion in model container [2022-04-27 13:16:58,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:58" (2/3) ... [2022-04-27 13:16:58,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3feae68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:16:58, skipping insertion in model container [2022-04-27 13:16:58,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:16:58" (3/3) ... [2022-04-27 13:16:58,754 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_valuebound10.c [2022-04-27 13:16:58,772 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:16:58,772 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:16:58,810 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:16:58,816 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@7689590b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@10c7a641 [2022-04-27 13:16:58,816 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:16:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:16:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:16:58,832 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:58,832 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:16:58,833 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:58,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:58,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1718462925, now seen corresponding path program 1 times [2022-04-27 13:16:58,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:58,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556138331] [2022-04-27 13:16:58,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:58,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:59,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:16:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:59,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(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); {40#true} is VALID [2022-04-27 13:16:59,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:16:59,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #106#return; {40#true} is VALID [2022-04-27 13:16:59,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:16:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:59,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:16:59,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:59,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:59,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-27 13:16:59,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:16:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:59,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:16:59,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:59,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:59,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-27 13:16:59,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:16:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:59,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:16:59,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:59,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:59,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #94#return; {41#false} is VALID [2022-04-27 13:16:59,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 13:16:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:59,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:16:59,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:59,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:59,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #96#return; {41#false} is VALID [2022-04-27 13:16:59,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:16:59,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(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); {40#true} is VALID [2022-04-27 13:16:59,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:16:59,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #106#return; {40#true} is VALID [2022-04-27 13:16:59,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret6 := main(); {40#true} is VALID [2022-04-27 13:16:59,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#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; {40#true} is VALID [2022-04-27 13:16:59,077 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 10 then 1 else 0)); {40#true} is VALID [2022-04-27 13:16:59,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:16:59,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:59,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:59,081 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-27 13:16:59,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {41#false} is VALID [2022-04-27 13:16:59,082 INFO L272 TraceCheckUtils]: 12: Hoare triple {41#false} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 10 then 1 else 0)); {40#true} is VALID [2022-04-27 13:16:59,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:16:59,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:59,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:59,083 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-27 13:16:59,083 INFO L272 TraceCheckUtils]: 17: Hoare triple {41#false} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40#true} is VALID [2022-04-27 13:16:59,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:16:59,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:59,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:59,084 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41#false} {41#false} #94#return; {41#false} is VALID [2022-04-27 13:16:59,084 INFO L272 TraceCheckUtils]: 22: Hoare triple {41#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)); {40#true} is VALID [2022-04-27 13:16:59,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:16:59,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:59,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:59,086 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41#false} {41#false} #96#return; {41#false} is VALID [2022-04-27 13:16:59,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {41#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41#false} is VALID [2022-04-27 13:16:59,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:16:59,087 INFO L272 TraceCheckUtils]: 29: Hoare triple {41#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)); {41#false} is VALID [2022-04-27 13:16:59,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:16:59,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 13:16:59,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 13:16:59,088 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:16:59,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:59,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556138331] [2022-04-27 13:16:59,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556138331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:59,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:59,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:16:59,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897418551] [2022-04-27 13:16:59,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:59,095 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:16:59,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:59,099 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:16:59,155 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:16:59,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:16:59,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:59,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:16:59,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:16:59,186 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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:16:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:59,385 INFO L93 Difference]: Finished difference Result 67 states and 106 transitions. [2022-04-27 13:16:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:16:59,385 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:16:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:59,387 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:16:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-04-27 13:16:59,396 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:16:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-04-27 13:16:59,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2022-04-27 13:16:59,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:59,531 INFO L225 Difference]: With dead ends: 67 [2022-04-27 13:16:59,531 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 13:16:59,533 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:16:59,535 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:59,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:16:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 13:16:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 13:16:59,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:59,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:16:59,561 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:16:59,561 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:16:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:59,565 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-27 13:16:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-27 13:16:59,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:59,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:59,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 32 states. [2022-04-27 13:16:59,567 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 32 states. [2022-04-27 13:16:59,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:59,571 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-27 13:16:59,571 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-27 13:16:59,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:59,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:59,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:59,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:16:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-04-27 13:16:59,576 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 33 [2022-04-27 13:16:59,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:59,577 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-04-27 13:16:59,577 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:16:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-27 13:16:59,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:16:59,578 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:59,578 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:16:59,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:16:59,579 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:59,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:59,579 INFO L85 PathProgramCache]: Analyzing trace with hash 657160210, now seen corresponding path program 1 times [2022-04-27 13:16:59,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:59,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342107305] [2022-04-27 13:16:59,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:59,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:59,618 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:59,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1236281011] [2022-04-27 13:16:59,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:59,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:59,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:59,621 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:16:59,622 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:16:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:59,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:16:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:59,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:00,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {270#true} call ULTIMATE.init(); {270#true} is VALID [2022-04-27 13:17:00,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#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); {270#true} is VALID [2022-04-27 13:17:00,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {270#true} assume true; {270#true} is VALID [2022-04-27 13:17:00,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {270#true} {270#true} #106#return; {270#true} is VALID [2022-04-27 13:17:00,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {270#true} call #t~ret6 := main(); {270#true} is VALID [2022-04-27 13:17:00,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {270#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; {270#true} is VALID [2022-04-27 13:17:00,287 INFO L272 TraceCheckUtils]: 6: Hoare triple {270#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 10 then 1 else 0)); {270#true} is VALID [2022-04-27 13:17:00,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {270#true} ~cond := #in~cond; {270#true} is VALID [2022-04-27 13:17:00,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {270#true} assume !(0 == ~cond); {270#true} is VALID [2022-04-27 13:17:00,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {270#true} assume true; {270#true} is VALID [2022-04-27 13:17:00,287 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {270#true} {270#true} #90#return; {270#true} is VALID [2022-04-27 13:17:00,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {270#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {270#true} is VALID [2022-04-27 13:17:00,288 INFO L272 TraceCheckUtils]: 12: Hoare triple {270#true} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 10 then 1 else 0)); {270#true} is VALID [2022-04-27 13:17:00,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {270#true} ~cond := #in~cond; {270#true} is VALID [2022-04-27 13:17:00,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {270#true} assume !(0 == ~cond); {270#true} is VALID [2022-04-27 13:17:00,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {270#true} assume true; {270#true} is VALID [2022-04-27 13:17:00,289 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {270#true} {270#true} #92#return; {270#true} is VALID [2022-04-27 13:17:00,289 INFO L272 TraceCheckUtils]: 17: Hoare triple {270#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {270#true} is VALID [2022-04-27 13:17:00,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {270#true} ~cond := #in~cond; {270#true} is VALID [2022-04-27 13:17:00,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {270#true} assume !(0 == ~cond); {270#true} is VALID [2022-04-27 13:17:00,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {270#true} assume true; {270#true} is VALID [2022-04-27 13:17:00,289 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {270#true} {270#true} #94#return; {270#true} is VALID [2022-04-27 13:17:00,290 INFO L272 TraceCheckUtils]: 22: Hoare triple {270#true} 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)); {270#true} is VALID [2022-04-27 13:17:00,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {270#true} ~cond := #in~cond; {270#true} is VALID [2022-04-27 13:17:00,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {270#true} assume !(0 == ~cond); {270#true} is VALID [2022-04-27 13:17:00,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {270#true} assume true; {270#true} is VALID [2022-04-27 13:17:00,290 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {270#true} {270#true} #96#return; {270#true} is VALID [2022-04-27 13:17:02,295 WARN L290 TraceCheckUtils]: 27: Hoare triple {270#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {356#(and (= (+ (* (- 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) (= main_~v~0 1))} is UNKNOWN [2022-04-27 13:17:02,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {356#(and (= (+ (* (- 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) (= main_~v~0 1))} assume !false; {356#(and (= (+ (* (- 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) (= main_~v~0 1))} is VALID [2022-04-27 13:17:02,801 INFO L272 TraceCheckUtils]: 29: Hoare triple {356#(and (= (+ (* (- 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) (= 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)); {363#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:17:02,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {363#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {367#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:02,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {367#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {271#false} is VALID [2022-04-27 13:17:02,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {271#false} assume !false; {271#false} is VALID [2022-04-27 13:17:02,811 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:17:02,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:02,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:02,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342107305] [2022-04-27 13:17:02,812 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:02,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236281011] [2022-04-27 13:17:02,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236281011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:02,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:02,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:17:02,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992291555] [2022-04-27 13:17:02,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:02,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-27 13:17:02,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:02,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:05,659 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:17:05,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:17:05,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:05,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:17:05,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:17:05,661 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:07,813 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:17:09,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:17:17,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:17:21,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:17:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:22,007 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-27 13:17:22,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:17:22,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-27 13:17:22,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-27 13:17:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:22,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-27 13:17:22,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-04-27 13:17:25,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 60 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:25,136 INFO L225 Difference]: With dead ends: 48 [2022-04-27 13:17:25,136 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 13:17:25,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-04-27 13:17:25,137 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:25,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 115 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 3 Unknown, 0 Unchecked, 8.7s Time] [2022-04-27 13:17:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 13:17:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-27 13:17:25,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:25,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:17:25,148 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:17:25,149 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:17:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:25,152 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-04-27 13:17:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2022-04-27 13:17:25,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:25,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:25,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 46 states. [2022-04-27 13:17:25,154 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 46 states. [2022-04-27 13:17:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:25,157 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-04-27 13:17:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2022-04-27 13:17:25,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:25,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:25,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:25,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:17:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2022-04-27 13:17:25,162 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 33 [2022-04-27 13:17:25,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:25,163 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2022-04-27 13:17:25,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:25,163 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-27 13:17:25,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 13:17:25,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:25,164 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2022-04-27 13:17:25,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:25,385 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:17:25,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:25,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:25,386 INFO L85 PathProgramCache]: Analyzing trace with hash 936002262, now seen corresponding path program 1 times [2022-04-27 13:17:25,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:25,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562808195] [2022-04-27 13:17:25,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:25,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:25,423 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:25,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126623577] [2022-04-27 13:17:25,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:25,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:25,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:25,444 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-04-27 13:17:25,455 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-04-27 13:17:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:25,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:17:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:25,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:25,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {605#true} is VALID [2022-04-27 13:17:25,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#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); {605#true} is VALID [2022-04-27 13:17:25,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:17:25,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #106#return; {605#true} is VALID [2022-04-27 13:17:25,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret6 := main(); {605#true} is VALID [2022-04-27 13:17:25,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#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; {605#true} is VALID [2022-04-27 13:17:25,766 INFO L272 TraceCheckUtils]: 6: Hoare triple {605#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 10 then 1 else 0)); {605#true} is VALID [2022-04-27 13:17:25,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:17:25,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:17:25,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:17:25,767 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {605#true} {605#true} #90#return; {605#true} is VALID [2022-04-27 13:17:25,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {605#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {605#true} is VALID [2022-04-27 13:17:25,768 INFO L272 TraceCheckUtils]: 12: Hoare triple {605#true} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 10 then 1 else 0)); {605#true} is VALID [2022-04-27 13:17:25,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:17:25,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:17:25,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:17:25,771 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {605#true} {605#true} #92#return; {605#true} is VALID [2022-04-27 13:17:25,771 INFO L272 TraceCheckUtils]: 17: Hoare triple {605#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {605#true} is VALID [2022-04-27 13:17:25,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:17:25,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:17:25,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:17:25,772 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {605#true} {605#true} #94#return; {605#true} is VALID [2022-04-27 13:17:25,772 INFO L272 TraceCheckUtils]: 22: Hoare triple {605#true} 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)); {605#true} is VALID [2022-04-27 13:17:25,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:17:25,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:17:25,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:17:25,774 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {605#true} {605#true} #96#return; {605#true} is VALID [2022-04-27 13:17:25,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {605#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {605#true} is VALID [2022-04-27 13:17:25,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {605#true} assume !false; {605#true} is VALID [2022-04-27 13:17:25,776 INFO L272 TraceCheckUtils]: 29: Hoare triple {605#true} 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)); {605#true} is VALID [2022-04-27 13:17:25,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {605#true} ~cond := #in~cond; {700#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:25,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {700#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {704#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:25,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {704#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {704#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:25,794 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {704#(not (= |__VERIFIER_assert_#in~cond| 0))} {605#true} #98#return; {711#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-27 13:17:25,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {711#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {715#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-27 13:17:25,796 INFO L272 TraceCheckUtils]: 35: Hoare triple {715#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} 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)); {719#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:17:25,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {719#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {723#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:25,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {723#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {606#false} is VALID [2022-04-27 13:17:25,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {606#false} assume !false; {606#false} is VALID [2022-04-27 13:17:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:17:25,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:26,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {606#false} assume !false; {606#false} is VALID [2022-04-27 13:17:26,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {723#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {606#false} is VALID [2022-04-27 13:17:26,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {719#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {723#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:26,293 INFO L272 TraceCheckUtils]: 35: Hoare triple {715#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} 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)); {719#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:17:26,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {742#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {715#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-27 13:17:26,295 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {704#(not (= |__VERIFIER_assert_#in~cond| 0))} {605#true} #98#return; {742#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-27 13:17:26,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {704#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {704#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:26,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {755#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {704#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:26,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {605#true} ~cond := #in~cond; {755#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:17:26,296 INFO L272 TraceCheckUtils]: 29: Hoare triple {605#true} 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)); {605#true} is VALID [2022-04-27 13:17:26,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {605#true} assume !false; {605#true} is VALID [2022-04-27 13:17:26,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {605#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {605#true} is VALID [2022-04-27 13:17:26,296 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {605#true} {605#true} #96#return; {605#true} is VALID [2022-04-27 13:17:26,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:17:26,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:17:26,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:17:26,297 INFO L272 TraceCheckUtils]: 22: Hoare triple {605#true} 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)); {605#true} is VALID [2022-04-27 13:17:26,297 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {605#true} {605#true} #94#return; {605#true} is VALID [2022-04-27 13:17:26,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:17:26,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:17:26,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:17:26,298 INFO L272 TraceCheckUtils]: 17: Hoare triple {605#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {605#true} is VALID [2022-04-27 13:17:26,298 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {605#true} {605#true} #92#return; {605#true} is VALID [2022-04-27 13:17:26,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:17:26,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:17:26,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:17:26,298 INFO L272 TraceCheckUtils]: 12: Hoare triple {605#true} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 10 then 1 else 0)); {605#true} is VALID [2022-04-27 13:17:26,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {605#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {605#true} is VALID [2022-04-27 13:17:26,299 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {605#true} {605#true} #90#return; {605#true} is VALID [2022-04-27 13:17:26,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:17:26,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:17:26,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:17:26,299 INFO L272 TraceCheckUtils]: 6: Hoare triple {605#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 10 then 1 else 0)); {605#true} is VALID [2022-04-27 13:17:26,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#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; {605#true} is VALID [2022-04-27 13:17:26,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret6 := main(); {605#true} is VALID [2022-04-27 13:17:26,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #106#return; {605#true} is VALID [2022-04-27 13:17:26,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:17:26,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#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); {605#true} is VALID [2022-04-27 13:17:26,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {605#true} is VALID [2022-04-27 13:17:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:17:26,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:26,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562808195] [2022-04-27 13:17:26,301 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:26,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126623577] [2022-04-27 13:17:26,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126623577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:26,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:26,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 13:17:26,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056255714] [2022-04-27 13:17:26,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:26,303 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 39 [2022-04-27 13:17:26,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:26,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:17:26,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:26,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:17:26,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:26,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:17:26,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:17:26,332 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:17:26,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:26,922 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-27 13:17:26,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:17:26,922 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 39 [2022-04-27 13:17:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:17:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-27 13:17:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:17:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-27 13:17:26,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-27 13:17:26,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:26,973 INFO L225 Difference]: With dead ends: 45 [2022-04-27 13:17:26,974 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 13:17:26,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 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-04-27 13:17:26,975 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:26,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 185 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 13:17:26,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 13:17:26,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 13:17:26,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:26,977 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:17:26,977 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:17:26,977 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:17:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:26,977 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:17:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:17:26,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:26,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:26,978 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:17:26,978 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:17:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:26,978 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:17:26,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:17:26,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:26,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:26,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:26,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:26,979 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:17:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 13:17:26,979 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-04-27 13:17:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:26,979 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 13:17:26,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:17:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:17:26,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:26,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:17:27,007 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-04-27 13:17:27,204 WARN L477 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-04-27 13:17:27,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 13:17:27,298 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 13:17:27,299 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 13:17:27,299 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 13:17:27,299 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-27 13:17:27,299 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 13:17:27,299 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 13:17:27,299 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 13:17:27,300 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 55) the Hoare annotation is: (let ((.cse0 (+ (* main_~v~0 2) (* main_~u~0 main_~u~0))) (.cse1 (* main_~v~0 main_~v~0)) (.cse2 (* main_~u~0 2)) (.cse3 (* main_~A~0 4))) (and (= .cse0 (+ .cse1 .cse2 .cse3 (* main_~r~0 4))) (= .cse0 (+ .cse1 .cse2 .cse3)))) [2022-04-27 13:17:27,300 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 59) no Hoare annotation was computed. [2022-04-27 13:17:27,300 INFO L902 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-27 13:17:27,300 INFO L899 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2022-04-27 13:17:27,300 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 35 55) no Hoare annotation was computed. [2022-04-27 13:17:27,300 INFO L895 garLoopResultBuilder]: At program point L48-2(lines 35 55) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-27 13:17:27,300 INFO L895 garLoopResultBuilder]: At program point L40-2(lines 40 46) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-27 13:17:27,301 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-27 13:17:27,301 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 35 55) no Hoare annotation was computed. [2022-04-27 13:17:27,301 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 13:17:27,301 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-04-27 13:17:27,301 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-27 13:17:27,301 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 48 54) no Hoare annotation was computed. [2022-04-27 13:17:27,301 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-27 13:17:27,301 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 40 46) no Hoare annotation was computed. [2022-04-27 13:17:27,302 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-27 13:17:27,302 INFO L902 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: true [2022-04-27 13:17:27,302 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 59) no Hoare annotation was computed. [2022-04-27 13:17:27,302 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 59) the Hoare annotation is: true [2022-04-27 13:17:27,302 INFO L902 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2022-04-27 13:17:27,302 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:17:27,302 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:17:27,302 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:17:27,303 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:17:27,303 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 13:17:27,303 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 13:17:27,303 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:17:27,303 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 13:17:27,303 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 13:17:27,303 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 13:17:27,303 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 13:17:27,303 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 13:17:27,304 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 13:17:27,306 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 13:17:27,308 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:17:27,311 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:17:27,311 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:17:27,314 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:17:27,314 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:17:27,314 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:17:27,314 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:17:27,314 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:17:27,314 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:17:27,314 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:17:27,315 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-04-27 13:17:27,315 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:17:27,315 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:17:27,315 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:17:27,315 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:17:27,315 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 13:17:27,315 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-04-27 13:17:27,315 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:17:27,315 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:17:27,315 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:17:27,315 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:17:27,315 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:17:27,315 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:17:27,316 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:17:27,316 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:17:27,316 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:17:27,316 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:17:27,316 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:17:27,316 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 13:17:27,316 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 13:17:27,316 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:17:27,316 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:17:27,316 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 13:17:27,316 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 13:17:27,316 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-27 13:17:27,316 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-27 13:17:27,317 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-27 13:17:27,318 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-27 13:17:27,318 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:17:27,318 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:17:27,319 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:17:27,319 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:17:27,319 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:17:27,319 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:17:27,319 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:17:27,319 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 13:17:27,319 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-27 13:17:27,319 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:17:27,319 INFO L163 areAnnotationChecker]: CFG has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:17:27,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:17:27 BoogieIcfgContainer [2022-04-27 13:17:27,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:17:27,327 INFO L158 Benchmark]: Toolchain (without parser) took 29226.47ms. Allocated memory was 185.6MB in the beginning and 254.8MB in the end (delta: 69.2MB). Free memory was 130.5MB in the beginning and 225.5MB in the end (delta: -95.0MB). Peak memory consumption was 115.6MB. Max. memory is 8.0GB. [2022-04-27 13:17:27,327 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:17:27,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.24ms. Allocated memory is still 185.6MB. Free memory was 130.3MB in the beginning and 160.0MB in the end (delta: -29.7MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-27 13:17:27,328 INFO L158 Benchmark]: Boogie Preprocessor took 40.72ms. Allocated memory is still 185.6MB. Free memory was 160.0MB in the beginning and 158.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:17:27,328 INFO L158 Benchmark]: RCFGBuilder took 356.17ms. Allocated memory is still 185.6MB. Free memory was 158.4MB in the beginning and 146.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:17:27,329 INFO L158 Benchmark]: TraceAbstraction took 28586.35ms. Allocated memory was 185.6MB in the beginning and 254.8MB in the end (delta: 69.2MB). Free memory was 145.8MB in the beginning and 225.5MB in the end (delta: -79.7MB). Peak memory consumption was 130.9MB. Max. memory is 8.0GB. [2022-04-27 13:17:27,330 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.11ms. Allocated memory is still 185.6MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.24ms. Allocated memory is still 185.6MB. Free memory was 130.3MB in the beginning and 160.0MB in the end (delta: -29.7MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.72ms. Allocated memory is still 185.6MB. Free memory was 160.0MB in the beginning and 158.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 356.17ms. Allocated memory is still 185.6MB. Free memory was 158.4MB in the beginning and 146.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 28586.35ms. Allocated memory was 185.6MB in the beginning and 254.8MB in the end (delta: 69.2MB). Free memory was 145.8MB in the beginning and 225.5MB in the end (delta: -79.7MB). Peak memory consumption was 130.9MB. 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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.5s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 340 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 243 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 97 mSDtfsCounter, 166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=2, 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 32 PreInvPairs, 46 NumberOfFragments, 161 HoareAnnotationTreeSize, 32 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 270 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 317 SizeOfPredicates, 9 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 23 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: 40]: Loop Invariant Derived loop invariant: v * 2 + u * u == v * v + u * 2 + A * 4 + r * 4 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: v * 2 + u * u == v * v + u * 2 + A * 4 + r * 4 RESULT: Ultimate proved your program to be correct! [2022-04-27 13:17:27,351 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...