/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_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:16:02,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:16:02,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:16:02,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:16:02,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:16:02,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:16:02,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:16:02,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:16:02,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:16:02,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:16:02,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:16:02,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:16:02,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:16:02,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:16:02,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:16:02,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:16:02,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:16:02,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:16:02,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:16:02,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:16:02,975 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:16:02,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:16:02,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:16:02,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:16:02,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:16:02,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:16:02,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:16:02,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:16:02,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:16:02,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:16:02,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:16:02,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:16:02,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:16:02,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:16:02,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:16:02,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:16:02,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:16:02,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:16:02,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:16:02,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:16:02,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:16:03,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:16:03,001 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:03,024 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:16:03,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:16:03,024 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:16:03,024 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:16:03,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:16:03,025 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:16:03,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:16:03,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:16:03,025 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:16:03,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:16:03,026 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:16:03,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:16:03,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:16:03,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:16:03,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:16:03,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:16:03,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:16:03,026 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:16:03,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:16:03,026 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:16:03,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:16:03,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:16:03,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:16:03,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:16:03,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:16:03,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:16:03,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:16:03,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:16:03,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:16:03,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:16:03,028 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:16:03,028 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:16:03,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:16:03,028 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:03,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:16:03,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:16:03,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:16:03,215 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:16:03,215 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:16:03,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound2.c [2022-04-27 13:16:03,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9795ff986/6d6f501a25794fd5a70bb2039c735137/FLAG88ab23ddc [2022-04-27 13:16:03,558 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:16:03,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound2.c [2022-04-27 13:16:03,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9795ff986/6d6f501a25794fd5a70bb2039c735137/FLAG88ab23ddc [2022-04-27 13:16:04,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9795ff986/6d6f501a25794fd5a70bb2039c735137 [2022-04-27 13:16:04,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:16:04,008 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:16:04,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:16:04,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:16:04,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:16:04,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:16:04" (1/1) ... [2022-04-27 13:16:04,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d7ad28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:04, skipping insertion in model container [2022-04-27 13:16:04,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:16:04" (1/1) ... [2022-04-27 13:16:04,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:16:04,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:16:04,171 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_unwindbound2.c[535,548] [2022-04-27 13:16:04,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:16:04,207 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:16:04,221 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_unwindbound2.c[535,548] [2022-04-27 13:16:04,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:16:04,260 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:16:04,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:04 WrapperNode [2022-04-27 13:16:04,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:16:04,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:16:04,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:16:04,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:16:04,268 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:04" (1/1) ... [2022-04-27 13:16:04,268 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:04" (1/1) ... [2022-04-27 13:16:04,278 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:04" (1/1) ... [2022-04-27 13:16:04,278 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:04" (1/1) ... [2022-04-27 13:16:04,287 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:04" (1/1) ... [2022-04-27 13:16:04,294 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:04" (1/1) ... [2022-04-27 13:16:04,297 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:04" (1/1) ... [2022-04-27 13:16:04,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:16:04,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:16:04,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:16:04,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:16:04,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:04" (1/1) ... [2022-04-27 13:16:04,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:16:04,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:04,325 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:04,331 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:04,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:16:04,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:16:04,351 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:16:04,351 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:16:04,353 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:16:04,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:16:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:16:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:16:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:16:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:16:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:16:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:16:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:16:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:16:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:16:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:16:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:16:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:16:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:16:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:16:04,402 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:16:04,403 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:16:04,571 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:16:04,575 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:16:04,575 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 13:16:04,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:16:04 BoogieIcfgContainer [2022-04-27 13:16:04,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:16:04,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:16:04,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:16:04,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:16:04,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:16:04" (1/3) ... [2022-04-27 13:16:04,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cec2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:16:04, skipping insertion in model container [2022-04-27 13:16:04,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:04" (2/3) ... [2022-04-27 13:16:04,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cec2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:16:04, skipping insertion in model container [2022-04-27 13:16:04,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:16:04" (3/3) ... [2022-04-27 13:16:04,582 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound2.c [2022-04-27 13:16:04,590 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:16:04,590 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:16:04,618 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:16:04,622 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@2f81461e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d848af [2022-04-27 13:16:04,622 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:16:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:16:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:16:04,638 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:04,638 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:16:04,639 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:04,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:04,645 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-27 13:16:04,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:04,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734925514] [2022-04-27 13:16:04,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:04,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:04,742 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:04,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53487688] [2022-04-27 13:16:04,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:04,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:04,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:04,744 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:04,745 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:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:04,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 13:16:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:04,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:04,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-27 13:16:04,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#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);~counter~0 := 0; {40#true} is VALID [2022-04-27 13:16:04,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:16:04,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-27 13:16:04,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-27 13:16:04,923 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-27 13:16:04,923 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} 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:04,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:16:04,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:04,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:04,924 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-27 13:16:04,924 INFO L272 TraceCheckUtils]: 11: 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)); {41#false} is VALID [2022-04-27 13:16:04,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:16:04,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:04,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:04,925 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-27 13:16:04,925 INFO L290 TraceCheckUtils]: 16: 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:04,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:16:04,926 INFO L272 TraceCheckUtils]: 18: 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:04,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:16:04,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 13:16:04,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 13:16:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 13:16:04,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:04,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:04,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734925514] [2022-04-27 13:16:04,928 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:04,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53487688] [2022-04-27 13:16:04,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53487688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:04,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:04,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 13:16:04,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559511091] [2022-04-27 13:16:04,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:04,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:16:04,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:04,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:04,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:04,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 13:16:04,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:04,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 13:16:04,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:16:04,989 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:05,056 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-27 13:16:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 13:16:05,057 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:16:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-27 13:16:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-27 13:16:05,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-27 13:16:05,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:05,160 INFO L225 Difference]: With dead ends: 67 [2022-04-27 13:16:05,160 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 13:16:05,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:16:05,164 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:05,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:16:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 13:16:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 13:16:05,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:05,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:05,185 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:05,185 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:05,188 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:16:05,188 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:16:05,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:05,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:05,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-27 13:16:05,189 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-27 13:16:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:05,192 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:16:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:16:05,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:05,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:05,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:05,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-27 13:16:05,195 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-27 13:16:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:05,195 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-27 13:16:05,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:05,195 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:16:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:16:05,196 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:05,196 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:16:05,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 13:16:05,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-27 13:16:05,403 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:05,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:05,404 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-27 13:16:05,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:05,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640721700] [2022-04-27 13:16:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:05,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:05,423 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:05,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133633986] [2022-04-27 13:16:05,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:05,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:05,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:05,425 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:16:05,426 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:16:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:05,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:16:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:05,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:05,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-27 13:16:05,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#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);~counter~0 := 0; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {315#(<= ~counter~0 0)} {307#true} #102#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {315#(<= ~counter~0 0)} call #t~ret9 := main(); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {315#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,674 INFO L272 TraceCheckUtils]: 6: Hoare triple {315#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #90#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,676 INFO L272 TraceCheckUtils]: 11: Hoare triple {315#(<= ~counter~0 0)} 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)); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,678 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #92#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {315#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:05,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {364#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:16:05,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#(<= |main_#t~post6| 0)} assume !(#t~post6 < 2);havoc #t~post6; {308#false} is VALID [2022-04-27 13:16:05,680 INFO L272 TraceCheckUtils]: 19: Hoare triple {308#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)); {308#false} is VALID [2022-04-27 13:16:05,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2022-04-27 13:16:05,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {308#false} assume 0 == ~cond; {308#false} is VALID [2022-04-27 13:16:05,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-27 13:16:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:16:05,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:05,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:05,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640721700] [2022-04-27 13:16:05,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:05,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133633986] [2022-04-27 13:16:05,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133633986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:05,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:05,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:16:05,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994117010] [2022-04-27 13:16:05,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:05,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:16:05,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:05,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:05,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:05,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:16:05,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:05,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:16:05,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:16:05,701 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:05,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:05,772 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-27 13:16:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:16:05,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:16:05,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-27 13:16:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-27 13:16:05,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-27 13:16:05,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:05,809 INFO L225 Difference]: With dead ends: 41 [2022-04-27 13:16:05,809 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 13:16:05,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:16:05,810 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:05,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:16:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 13:16:05,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 13:16:05,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:05,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:05,820 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:05,820 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:05,822 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 13:16:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:16:05,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:05,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:05,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-27 13:16:05,823 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-27 13:16:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:05,825 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 13:16:05,825 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:16:05,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:05,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:05,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:05,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-27 13:16:05,828 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-27 13:16:05,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:05,828 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-27 13:16:05,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:16:05,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:16:05,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:05,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:16:05,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 13:16:06,043 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,SelfDestructingSolverStorable1 [2022-04-27 13:16:06,044 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-27 13:16:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:06,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170150176] [2022-04-27 13:16:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:06,055 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:06,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2077937860] [2022-04-27 13:16:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:06,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:06,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:06,062 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:16:06,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 13:16:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:06,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:16:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:06,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:08,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-27 13:16:08,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#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);~counter~0 := 0; {554#true} is VALID [2022-04-27 13:16:08,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:16:08,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #102#return; {554#true} is VALID [2022-04-27 13:16:08,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret9 := main(); {554#true} is VALID [2022-04-27 13:16:08,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {554#true} is VALID [2022-04-27 13:16:08,194 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {554#true} is VALID [2022-04-27 13:16:08,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-27 13:16:08,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-27 13:16:08,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:16:08,194 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} #90#return; {554#true} is VALID [2022-04-27 13:16:08,194 INFO L272 TraceCheckUtils]: 11: Hoare triple {554#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)); {554#true} is VALID [2022-04-27 13:16:08,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-27 13:16:08,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-27 13:16:08,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:16:08,195 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} #92#return; {554#true} is VALID [2022-04-27 13:16:10,199 WARN L290 TraceCheckUtils]: 16: Hoare triple {554#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {607#(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:16:10,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {607#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {607#(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:16:10,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {607#(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 !!(#t~post6 < 2);havoc #t~post6; {607#(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:16:10,712 INFO L272 TraceCheckUtils]: 19: Hoare triple {607#(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)); {617#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:16:10,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:16:10,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {555#false} is VALID [2022-04-27 13:16:10,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-27 13:16:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:16:10,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:10,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:10,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170150176] [2022-04-27 13:16:10,714 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:10,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077937860] [2022-04-27 13:16:10,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077937860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:10,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:10,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:16:10,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788749327] [2022-04-27 13:16:10,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:10,715 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:16:10,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:10,716 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:16:13,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:13,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:16:13,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:13,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:16:13,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:16:13,504 INFO L87 Difference]: Start difference. First operand 34 states and 43 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:16:18,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:16:20,981 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:16:22,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:16:27,353 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:16:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:27,371 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-27 13:16:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:16:27,372 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:16:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:27,372 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:16:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-27 13:16:27,373 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:16:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-27 13:16:27,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-27 13:16:29,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:29,218 INFO L225 Difference]: With dead ends: 53 [2022-04-27 13:16:29,218 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 13:16:29,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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:16:29,219 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:29,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 119 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 2 Unknown, 0 Unchecked, 9.6s Time] [2022-04-27 13:16:29,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 13:16:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 13:16:29,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:29,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:16:29,232 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:16:29,232 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:16:29,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:29,236 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-27 13:16:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-27 13:16:29,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:29,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:29,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-27 13:16:29,237 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-27 13:16:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:29,239 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-27 13:16:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-27 13:16:29,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:29,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:29,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:29,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:29,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:16:29,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-27 13:16:29,242 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-27 13:16:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:29,242 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-27 13:16:29,243 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:16:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-27 13:16:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 13:16:29,243 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:29,243 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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:29,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 13:16:29,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:29,461 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:29,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:29,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-27 13:16:29,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:29,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053281221] [2022-04-27 13:16:29,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:29,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:29,472 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:29,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502373414] [2022-04-27 13:16:29,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:29,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:29,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:29,477 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:16:29,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 13:16:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:29,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:16:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:29,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:29,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-27 13:16:29,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#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);~counter~0 := 0; {877#true} is VALID [2022-04-27 13:16:29,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:16:29,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-27 13:16:29,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-27 13:16:29,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {877#true} is VALID [2022-04-27 13:16:29,660 INFO L272 TraceCheckUtils]: 6: Hoare triple {877#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {877#true} is VALID [2022-04-27 13:16:29,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:16:29,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:16:29,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:16:29,661 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-27 13:16:29,661 INFO L272 TraceCheckUtils]: 11: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:16:29,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:16:29,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:16:29,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:16:29,661 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-27 13:16:29,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {877#true} is VALID [2022-04-27 13:16:29,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-27 13:16:29,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 2);havoc #t~post6; {877#true} is VALID [2022-04-27 13:16:29,662 INFO L272 TraceCheckUtils]: 19: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:16:29,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} ~cond := #in~cond; {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:16:29,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:16:29,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:16:29,664 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} {877#true} #94#return; {953#(= (+ (* 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:16:29,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {953#(= (+ (* 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); {957#(= (+ (* 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:16:29,666 INFO L272 TraceCheckUtils]: 25: Hoare triple {957#(= (+ (* 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)); {961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:16:29,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:16:29,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-27 13:16:29,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-27 13:16:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:16:29,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:16:30,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-27 13:16:30,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-27 13:16:30,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:16:30,055 INFO L272 TraceCheckUtils]: 25: Hoare triple {957#(= (+ (* 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)); {961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:16:30,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {984#(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); {957#(= (+ (* 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:16:30,057 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} {877#true} #94#return; {984#(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:16:30,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:16:30,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {997#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:16:30,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} ~cond := #in~cond; {997#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:16:30,064 INFO L272 TraceCheckUtils]: 19: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:16:30,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 2);havoc #t~post6; {877#true} is VALID [2022-04-27 13:16:30,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-27 13:16:30,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {877#true} is VALID [2022-04-27 13:16:30,064 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-27 13:16:30,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:16:30,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:16:30,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:16:30,065 INFO L272 TraceCheckUtils]: 11: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:16:30,065 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-27 13:16:30,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:16:30,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:16:30,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:16:30,065 INFO L272 TraceCheckUtils]: 6: Hoare triple {877#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {877#true} is VALID [2022-04-27 13:16:30,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {877#true} is VALID [2022-04-27 13:16:30,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-27 13:16:30,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-27 13:16:30,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:16:30,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#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);~counter~0 := 0; {877#true} is VALID [2022-04-27 13:16:30,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-27 13:16:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:16:30,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:30,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053281221] [2022-04-27 13:16:30,066 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:30,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502373414] [2022-04-27 13:16:30,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502373414] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:16:30,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:16:30,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 13:16:30,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350596172] [2022-04-27 13:16:30,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:16:30,067 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 13:16:30,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:30,068 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:16:30,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:30,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:16:30,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:30,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:16:30,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:16:30,089 INFO L87 Difference]: Start difference. First operand 50 states and 67 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:16:30,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:30,506 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-27 13:16:30,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:16:30,506 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 13:16:30,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:30,506 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:16:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 13:16:30,508 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:16:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 13:16:30,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-27 13:16:30,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:30,548 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:16:30,548 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 13:16:30,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:16:30,549 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:30,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 171 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:16:30,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 13:16:30,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 13:16:30,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:30,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:16:30,564 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:16:30,565 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:16:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:30,566 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:16:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:16:30,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:30,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:30,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-27 13:16:30,568 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-27 13:16:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:30,569 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:16:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:16:30,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:30,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:30,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:30,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:16:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-27 13:16:30,572 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 29 [2022-04-27 13:16:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:30,572 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-04-27 13:16:30,572 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:16:30,573 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:16:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 13:16:30,573 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:30,573 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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:16:30,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 13:16:30,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:30,774 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:30,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-27 13:16:30,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:30,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71054800] [2022-04-27 13:16:30,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:30,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:30,793 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:30,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114695784] [2022-04-27 13:16:30,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:30,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:30,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:30,796 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:16:30,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 13:16:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:30,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:16:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:30,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:31,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {1324#true} call ULTIMATE.init(); {1324#true} is VALID [2022-04-27 13:16:31,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {1324#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);~counter~0 := 0; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {1332#(<= ~counter~0 0)} assume true; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1332#(<= ~counter~0 0)} {1324#true} #102#return; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {1332#(<= ~counter~0 0)} call #t~ret9 := main(); {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {1332#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,020 INFO L272 TraceCheckUtils]: 6: Hoare triple {1332#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {1332#(<= ~counter~0 0)} ~cond := #in~cond; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#(<= ~counter~0 0)} assume !(0 == ~cond); {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {1332#(<= ~counter~0 0)} assume true; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,022 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1332#(<= ~counter~0 0)} {1332#(<= ~counter~0 0)} #90#return; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,022 INFO L272 TraceCheckUtils]: 11: Hoare triple {1332#(<= ~counter~0 0)} 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)); {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {1332#(<= ~counter~0 0)} ~cond := #in~cond; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {1332#(<= ~counter~0 0)} assume !(0 == ~cond); {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {1332#(<= ~counter~0 0)} assume true; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,023 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1332#(<= ~counter~0 0)} {1332#(<= ~counter~0 0)} #92#return; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {1332#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:31,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {1332#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:31,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {1381#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:31,025 INFO L272 TraceCheckUtils]: 19: Hoare triple {1381#(<= ~counter~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)); {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:31,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {1381#(<= ~counter~0 1)} ~cond := #in~cond; {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:31,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {1381#(<= ~counter~0 1)} assume !(0 == ~cond); {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:31,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {1381#(<= ~counter~0 1)} assume true; {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:31,026 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1381#(<= ~counter~0 1)} {1381#(<= ~counter~0 1)} #94#return; {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:31,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {1381#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:31,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {1381#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1406#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:16:31,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {1406#(<= |main_#t~post7| 1)} assume !(#t~post7 < 2);havoc #t~post7; {1325#false} is VALID [2022-04-27 13:16:31,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {1325#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1325#false} is VALID [2022-04-27 13:16:31,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {1325#false} assume !(#t~post8 < 2);havoc #t~post8; {1325#false} is VALID [2022-04-27 13:16:31,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {1325#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1325#false} is VALID [2022-04-27 13:16:31,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {1325#false} assume !(#t~post6 < 2);havoc #t~post6; {1325#false} is VALID [2022-04-27 13:16:31,027 INFO L272 TraceCheckUtils]: 31: Hoare triple {1325#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)); {1325#false} is VALID [2022-04-27 13:16:31,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {1325#false} ~cond := #in~cond; {1325#false} is VALID [2022-04-27 13:16:31,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {1325#false} assume 0 == ~cond; {1325#false} is VALID [2022-04-27 13:16:31,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {1325#false} assume !false; {1325#false} is VALID [2022-04-27 13:16:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:16:31,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:31,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:31,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71054800] [2022-04-27 13:16:31,028 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:31,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114695784] [2022-04-27 13:16:31,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114695784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:31,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:31,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:16:31,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455118356] [2022-04-27 13:16:31,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:31,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-27 13:16:31,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:31,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:16:31,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:31,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:16:31,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:31,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:16:31,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:16:31,048 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:16:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:31,141 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-27 13:16:31,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:16:31,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-27 13:16:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:16:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 13:16:31,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:16:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 13:16:31,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-27 13:16:31,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:31,195 INFO L225 Difference]: With dead ends: 97 [2022-04-27 13:16:31,195 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 13:16:31,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:16:31,196 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:31,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 120 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:16:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 13:16:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-27 13:16:31,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:31,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:16:31,208 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:16:31,208 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:16:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:31,210 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-27 13:16:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-27 13:16:31,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:31,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:31,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-27 13:16:31,211 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-27 13:16:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:31,213 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-27 13:16:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-27 13:16:31,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:31,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:31,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:31,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:16:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-27 13:16:31,215 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 35 [2022-04-27 13:16:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:31,215 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-04-27 13:16:31,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:16:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-27 13:16:31,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 13:16:31,216 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:31,216 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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, 1] [2022-04-27 13:16:31,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 13:16:31,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:31,428 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:31,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:31,429 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-27 13:16:31,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:31,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138281339] [2022-04-27 13:16:31,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:31,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:31,442 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:31,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954179687] [2022-04-27 13:16:31,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:31,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:31,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:31,448 INFO L229 MonitoredProcess]: Starting monitored process 7 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:31,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 13:16:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:16:31,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 13:16:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:16:31,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 13:16:31,520 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 13:16:31,521 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:16:31,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 13:16:31,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:31,765 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-27 13:16:31,768 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:16:31,787 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:16:31,787 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 13:16:31,787 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:16:31,787 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:16:31,787 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:16:31,787 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 13:16:31,787 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 13:16:31,787 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:16:31,787 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:16:31,787 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:16:31,787 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-27 13:16:31,788 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 13:16:31,789 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 13:16:31,789 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:16:31,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:16:31 BoogieIcfgContainer [2022-04-27 13:16:31,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:16:31,791 INFO L158 Benchmark]: Toolchain (without parser) took 27782.37ms. Allocated memory was 172.0MB in the beginning and 221.2MB in the end (delta: 49.3MB). Free memory was 122.4MB in the beginning and 189.9MB in the end (delta: -67.5MB). Peak memory consumption was 98.5MB. Max. memory is 8.0GB. [2022-04-27 13:16:31,791 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 172.0MB. Free memory was 139.0MB in the beginning and 138.9MB in the end (delta: 153.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:16:31,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.37ms. Allocated memory is still 172.0MB. Free memory was 122.2MB in the beginning and 147.9MB in the end (delta: -25.7MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-27 13:16:31,791 INFO L158 Benchmark]: Boogie Preprocessor took 36.55ms. Allocated memory is still 172.0MB. Free memory was 147.9MB in the beginning and 145.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:16:31,791 INFO L158 Benchmark]: RCFGBuilder took 277.80ms. Allocated memory is still 172.0MB. Free memory was 145.8MB in the beginning and 133.8MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:16:31,791 INFO L158 Benchmark]: TraceAbstraction took 27212.52ms. Allocated memory was 172.0MB in the beginning and 221.2MB in the end (delta: 49.3MB). Free memory was 133.2MB in the beginning and 189.9MB in the end (delta: -56.6MB). Peak memory consumption was 109.5MB. Max. memory is 8.0GB. [2022-04-27 13:16:31,792 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.10ms. Allocated memory is still 172.0MB. Free memory was 139.0MB in the beginning and 138.9MB in the end (delta: 153.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.37ms. Allocated memory is still 172.0MB. Free memory was 122.2MB in the beginning and 147.9MB in the end (delta: -25.7MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.55ms. Allocated memory is still 172.0MB. Free memory was 147.9MB in the beginning and 145.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 277.80ms. Allocated memory is still 172.0MB. Free memory was 145.8MB in the beginning and 133.8MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 27212.52ms. Allocated memory was 172.0MB in the beginning and 221.2MB in the end (delta: 49.3MB). Free memory was 133.2MB in the beginning and 189.9MB in the end (delta: -56.6MB). Peak memory consumption was 109.5MB. 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 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [\old(counter)=6, counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(counter)=0, A=2147483647, counter=0, R=1] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [\old(counter)=0, A=2147483647, counter=0, R=1] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [\old(counter)=0, A=2147483647, counter=0, r=-2147483646, R=1, u=3, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=2147483647, counter=1, counter++=0, R=1, r=-2147483646, u=3, v=1] [L34] COND TRUE counter++<2 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=2147483647, counter=1, r=-2147483646, R=1, u=3, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=2147483647, counter=1, r=-2147483646, R=1, u=3, v=1] [L39] EXPR counter++ VAL [\old(counter)=0, A=2147483647, counter=2, counter++=1, R=1, r=-2147483646, u=3, v=1] [L39] COND TRUE counter++<2 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=2147483647, counter=2, R=1, r=-2147483646, u=3, v=1] [L41] COND TRUE !(r > 0) VAL [\old(counter)=0, A=2147483647, counter=2, r=-2147483646, R=1, u=3, v=1] [L47] EXPR counter++ VAL [\old(counter)=0, A=2147483647, counter=3, counter++=2, R=1, r=-2147483646, u=3, v=1] [L47] COND FALSE !(counter++<2) [L34] EXPR counter++ VAL [\old(counter)=0, A=2147483647, counter=4, counter++=3, R=1, r=-2147483646, u=3, v=1] [L34] COND FALSE !(counter++<2) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, \old(counter)=0, counter=4] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=4] [L14] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 557 SdHoareTripleChecker+Invalid, 9.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 371 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 182 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 186 mSDtfsCounter, 182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=5, InterpolantAutomatonStates: 24, 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, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 441 SizeOfPredicates, 12 NumberOfNonLiveVariables, 497 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 30/32 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-27 13:16:31,806 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...