/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:17:45,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:17:45,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:17:45,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:17:45,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:17:45,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:17:45,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:17:45,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:17:45,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:17:45,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:17:45,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:17:45,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:17:45,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:17:45,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:17:45,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:17:45,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:17:45,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:17:45,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:17:45,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:17:45,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:17:45,571 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:17:45,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:17:45,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:17:45,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:17:45,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:17:45,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:17:45,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:17:45,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:17:45,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:17:45,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:17:45,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:17:45,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:17:45,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:17:45,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:17:45,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:17:45,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:17:45,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:17:45,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:17:45,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:17:45,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:17:45,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:17:45,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:17:45,590 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:17:45,619 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:17:45,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:17:45,620 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:17:45,620 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:17:45,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:17:45,620 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:17:45,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:17:45,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:17:45,621 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:17:45,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:17:45,622 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:17:45,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:17:45,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:17:45,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:17:45,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:17:45,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:17:45,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:17:45,623 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:17:45,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:17:45,624 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:17:45,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:17:45,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:17:45,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:17:45,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:17:45,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:17:45,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:17:45,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:17:45,625 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:17:45,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:17:45,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:17:45,625 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:17:45,626 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:17:45,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:17:45,626 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:17:45,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:17:45,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:17:45,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:17:45,869 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:17:45,870 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:17:45,871 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound10.c [2022-04-27 13:17:45,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75241d49/89c82efb40b2408caf0d2f268a9178ed/FLAGef9864078 [2022-04-27 13:17:46,299 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:17:46,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound10.c [2022-04-27 13:17:46,304 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75241d49/89c82efb40b2408caf0d2f268a9178ed/FLAGef9864078 [2022-04-27 13:17:46,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75241d49/89c82efb40b2408caf0d2f268a9178ed [2022-04-27 13:17:46,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:17:46,317 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:17:46,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:17:46,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:17:46,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:17:46,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:17:46" (1/1) ... [2022-04-27 13:17:46,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211fc9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:46, skipping insertion in model container [2022-04-27 13:17:46,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:17:46" (1/1) ... [2022-04-27 13:17:46,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:17:46,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:17:46,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound10.c[524,537] [2022-04-27 13:17:46,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:17:46,506 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:17:46,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound10.c[524,537] [2022-04-27 13:17:46,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:17:46,535 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:17:46,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:46 WrapperNode [2022-04-27 13:17:46,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:17:46,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:17:46,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:17:46,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:17:46,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:46" (1/1) ... [2022-04-27 13:17:46,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:46" (1/1) ... [2022-04-27 13:17:46,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:46" (1/1) ... [2022-04-27 13:17:46,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:46" (1/1) ... [2022-04-27 13:17:46,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:46" (1/1) ... [2022-04-27 13:17:46,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:46" (1/1) ... [2022-04-27 13:17:46,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:46" (1/1) ... [2022-04-27 13:17:46,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:17:46,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:17:46,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:17:46,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:17:46,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:46" (1/1) ... [2022-04-27 13:17:46,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:17:46,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:46,587 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:17:46,588 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:17:46,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:17:46,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:17:46,614 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:17:46,614 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:17:46,614 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:17:46,614 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:17:46,614 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:17:46,614 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:17:46,614 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:17:46,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:17:46,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:17:46,615 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:17:46,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:17:46,615 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:17:46,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:17:46,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:17:46,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:17:46,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:17:46,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:17:46,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:17:46,667 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:17:46,668 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:17:46,790 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:17:46,795 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:17:46,796 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 13:17:46,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:17:46 BoogieIcfgContainer [2022-04-27 13:17:46,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:17:46,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:17:46,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:17:46,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:17:46,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:17:46" (1/3) ... [2022-04-27 13:17:46,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db1746d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:17:46, skipping insertion in model container [2022-04-27 13:17:46,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:46" (2/3) ... [2022-04-27 13:17:46,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db1746d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:17:46, skipping insertion in model container [2022-04-27 13:17:46,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:17:46" (3/3) ... [2022-04-27 13:17:46,810 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound10.c [2022-04-27 13:17:46,821 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:17:46,821 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:17:46,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:17:46,917 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@6b1831d6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4276024 [2022-04-27 13:17:46,917 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:17:46,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:17:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:17:46,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:46,933 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:17:46,933 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:46,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:46,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-27 13:17:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:46,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372849350] [2022-04-27 13:17:46,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:46,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:47,092 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:47,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66289084] [2022-04-27 13:17:47,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:47,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:47,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:47,103 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:17:47,106 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:17:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:47,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 13:17:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:47,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:47,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2022-04-27 13:17:47,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#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; {33#true} is VALID [2022-04-27 13:17:47,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 13:17:47,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-27 13:17:47,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-27 13:17:47,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#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; {33#true} is VALID [2022-04-27 13:17:47,315 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {33#true} is VALID [2022-04-27 13:17:47,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 13:17:47,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 13:17:47,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 13:17:47,317 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-27 13:17:47,317 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#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)); {34#false} is VALID [2022-04-27 13:17:47,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 13:17:47,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 13:17:47,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 13:17:47,318 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-27 13:17:47,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34#false} is VALID [2022-04-27 13:17:47,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-27 13:17:47,319 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#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)); {34#false} is VALID [2022-04-27 13:17:47,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 13:17:47,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-27 13:17:47,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 13:17:47,325 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:17:47,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:47,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:47,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372849350] [2022-04-27 13:17:47,327 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:47,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66289084] [2022-04-27 13:17:47,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66289084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:47,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:47,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 13:17:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460739542] [2022-04-27 13:17:47,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:47,337 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:17:47,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:47,341 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:17:47,376 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:17:47,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 13:17:47,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:47,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 13:17:47,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:17:47,403 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 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:17:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:47,467 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-27 13:17:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 13:17:47,467 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:17:47,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:47,469 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:17:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-27 13:17:47,477 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:17:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-27 13:17:47,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2022-04-27 13:17:47,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:47,583 INFO L225 Difference]: With dead ends: 53 [2022-04-27 13:17:47,583 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 13:17:47,586 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:17:47,591 INFO L413 NwaCegarLoop]: 34 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, 34 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:17:47,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 13:17:47,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 13:17:47,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:47,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:47,623 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:47,623 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:47,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:47,632 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 13:17:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 13:17:47,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:47,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:47,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 13:17:47,640 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 13:17:47,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:47,643 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 13:17:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 13:17:47,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:47,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:47,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:47,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:47,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-27 13:17:47,650 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-27 13:17:47,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:47,651 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-27 13:17:47,651 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:17:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 13:17:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:17:47,652 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:47,652 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:17:47,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:47,875 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:17:47,875 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-27 13:17:47,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:47,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282526499] [2022-04-27 13:17:47,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:47,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:47,897 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:47,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1414309146] [2022-04-27 13:17:47,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:47,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:47,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:47,899 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:17:47,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 13:17:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:47,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:17:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:47,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:48,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-27 13:17:48,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#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; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264#(<= ~counter~0 0)} {256#true} #67#return; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {264#(<= ~counter~0 0)} call #t~ret7 := main(); {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {264#(<= ~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; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {264#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(<= ~counter~0 0)} ~cond := #in~cond; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#(<= ~counter~0 0)} assume !(0 == ~cond); {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,154 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} #59#return; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,155 INFO L272 TraceCheckUtils]: 11: Hoare triple {264#(<= ~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)); {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {264#(<= ~counter~0 0)} ~cond := #in~cond; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {264#(<= ~counter~0 0)} assume !(0 == ~cond); {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,157 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} #61#return; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {264#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:48,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {264#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {313#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:17:48,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {313#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {257#false} is VALID [2022-04-27 13:17:48,158 INFO L272 TraceCheckUtils]: 19: Hoare triple {257#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)); {257#false} is VALID [2022-04-27 13:17:48,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2022-04-27 13:17:48,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2022-04-27 13:17:48,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 13:17:48,159 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:17:48,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:48,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:48,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282526499] [2022-04-27 13:17:48,160 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:48,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414309146] [2022-04-27 13:17:48,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414309146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:48,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:48,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:17:48,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172542553] [2022-04-27 13:17:48,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:48,161 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:17:48,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:48,162 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:17:48,181 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:17:48,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:17:48,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:48,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:17:48,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:17:48,182 INFO L87 Difference]: Start difference. First operand 25 states and 29 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:17:48,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:48,246 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 13:17:48,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:17:48,246 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:17:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:48,247 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:17:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 13:17:48,253 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:17:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 13:17:48,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-27 13:17:48,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:48,301 INFO L225 Difference]: With dead ends: 34 [2022-04-27 13:17:48,301 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 13:17:48,301 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:17:48,304 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:48,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 13:17:48,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 13:17:48,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:48,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:48,314 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:48,315 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:48,317 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 13:17:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 13:17:48,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:48,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:48,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-27 13:17:48,318 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-27 13:17:48,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:48,320 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 13:17:48,320 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 13:17:48,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:48,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:48,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:48,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 13:17:48,322 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-27 13:17:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:48,322 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 13:17:48,322 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:17:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 13:17:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:17:48,323 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:48,323 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:17:48,346 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:17:48,545 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:17:48,546 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:48,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:48,547 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-27 13:17:48,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:48,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846254407] [2022-04-27 13:17:48,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:48,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:48,561 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:48,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [412811000] [2022-04-27 13:17:48,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:48,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:48,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:48,563 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:17:48,564 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:17:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:48,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:17:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:48,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:49,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {469#true} call ULTIMATE.init(); {469#true} is VALID [2022-04-27 13:17:49,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#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; {469#true} is VALID [2022-04-27 13:17:49,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-27 13:17:49,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {469#true} {469#true} #67#return; {469#true} is VALID [2022-04-27 13:17:49,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {469#true} call #t~ret7 := main(); {469#true} is VALID [2022-04-27 13:17:49,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {469#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; {469#true} is VALID [2022-04-27 13:17:49,078 INFO L272 TraceCheckUtils]: 6: Hoare triple {469#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {469#true} is VALID [2022-04-27 13:17:49,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#true} ~cond := #in~cond; {469#true} is VALID [2022-04-27 13:17:49,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {469#true} assume !(0 == ~cond); {469#true} is VALID [2022-04-27 13:17:49,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-27 13:17:49,079 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {469#true} {469#true} #59#return; {469#true} is VALID [2022-04-27 13:17:49,079 INFO L272 TraceCheckUtils]: 11: Hoare triple {469#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)); {469#true} is VALID [2022-04-27 13:17:49,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {469#true} ~cond := #in~cond; {469#true} is VALID [2022-04-27 13:17:49,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#true} assume !(0 == ~cond); {469#true} is VALID [2022-04-27 13:17:49,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-27 13:17:49,079 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {469#true} {469#true} #61#return; {469#true} is VALID [2022-04-27 13:17:49,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {469#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:17:49,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {522#(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; {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:17:49,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {522#(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 < 10);havoc #t~post6; {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:17:49,789 INFO L272 TraceCheckUtils]: 19: Hoare triple {522#(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)); {532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:17:49,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:49,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {470#false} is VALID [2022-04-27 13:17:49,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-04-27 13:17:49,791 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:17:49,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:49,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:49,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846254407] [2022-04-27 13:17:49,792 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:49,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412811000] [2022-04-27 13:17:49,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412811000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:49,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:49,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:17:49,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243065405] [2022-04-27 13:17:49,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:49,793 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:17:49,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:49,793 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:17:50,897 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:17:50,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:17:50,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:50,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:17:50,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:17:50,898 INFO L87 Difference]: Start difference. First operand 27 states and 31 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:17:52,284 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:17:54,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:17:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:54,836 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 13:17:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:17:54,836 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:17:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:54,837 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:17:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-27 13:17:54,839 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:17:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-27 13:17:54,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-27 13:18:00,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 42 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:00,465 INFO L225 Difference]: With dead ends: 39 [2022-04-27 13:18:00,465 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 13:18:00,466 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:18:00,467 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:00,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-27 13:18:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 13:18:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-27 13:18:00,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:00,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:18:00,479 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:18:00,480 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:18:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:00,482 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 13:18:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-27 13:18:00,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:00,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:00,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-27 13:18:00,484 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-27 13:18:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:00,486 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 13:18:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-27 13:18:00,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:00,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:00,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:00,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:18:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-27 13:18:00,489 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2022-04-27 13:18:00,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:00,489 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-27 13:18:00,490 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:18:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 13:18:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 13:18:00,491 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:00,491 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:18:00,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 13:18:00,695 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:18:00,696 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:00,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:00,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-27 13:18:00,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:00,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098239727] [2022-04-27 13:18:00,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:00,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:00,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:00,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1067573322] [2022-04-27 13:18:00,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:00,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:00,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:00,712 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:18:00,735 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:18:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:00,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:18:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:00,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:00,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {724#true} is VALID [2022-04-27 13:18:00,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#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; {724#true} is VALID [2022-04-27 13:18:00,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-27 13:18:00,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #67#return; {724#true} is VALID [2022-04-27 13:18:00,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret7 := main(); {724#true} is VALID [2022-04-27 13:18:00,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#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; {724#true} is VALID [2022-04-27 13:18:00,968 INFO L272 TraceCheckUtils]: 6: Hoare triple {724#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {724#true} is VALID [2022-04-27 13:18:00,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {724#true} ~cond := #in~cond; {724#true} is VALID [2022-04-27 13:18:00,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#true} assume !(0 == ~cond); {724#true} is VALID [2022-04-27 13:18:00,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-27 13:18:00,968 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {724#true} {724#true} #59#return; {724#true} is VALID [2022-04-27 13:18:00,969 INFO L272 TraceCheckUtils]: 11: Hoare triple {724#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)); {724#true} is VALID [2022-04-27 13:18:00,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#true} ~cond := #in~cond; {724#true} is VALID [2022-04-27 13:18:00,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#true} assume !(0 == ~cond); {724#true} is VALID [2022-04-27 13:18:00,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-27 13:18:00,969 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {724#true} {724#true} #61#return; {724#true} is VALID [2022-04-27 13:18:00,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {724#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {724#true} is VALID [2022-04-27 13:18:00,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {724#true} is VALID [2022-04-27 13:18:00,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {724#true} assume !!(#t~post6 < 10);havoc #t~post6; {724#true} is VALID [2022-04-27 13:18:00,970 INFO L272 TraceCheckUtils]: 19: Hoare triple {724#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)); {724#true} is VALID [2022-04-27 13:18:00,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {724#true} ~cond := #in~cond; {789#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:00,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {789#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:00,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:00,974 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} {724#true} #63#return; {800#(= (+ (* 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:18:00,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {800#(= (+ (* 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); {804#(= (+ (* 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:18:00,975 INFO L272 TraceCheckUtils]: 25: Hoare triple {804#(= (+ (* 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)); {808#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:18:00,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {808#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {812#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:00,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {812#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {725#false} is VALID [2022-04-27 13:18:00,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {725#false} assume !false; {725#false} is VALID [2022-04-27 13:18:00,976 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:18:00,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:01,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {725#false} assume !false; {725#false} is VALID [2022-04-27 13:18:01,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {812#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {725#false} is VALID [2022-04-27 13:18:01,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {808#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {812#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:01,393 INFO L272 TraceCheckUtils]: 25: Hoare triple {804#(= (+ (* 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)); {808#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:18:01,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {831#(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); {804#(= (+ (* 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:18:01,395 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} {724#true} #63#return; {831#(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:18:01,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:01,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {844#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:01,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {724#true} ~cond := #in~cond; {844#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:18:01,399 INFO L272 TraceCheckUtils]: 19: Hoare triple {724#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)); {724#true} is VALID [2022-04-27 13:18:01,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {724#true} assume !!(#t~post6 < 10);havoc #t~post6; {724#true} is VALID [2022-04-27 13:18:01,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {724#true} is VALID [2022-04-27 13:18:01,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {724#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {724#true} is VALID [2022-04-27 13:18:01,399 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {724#true} {724#true} #61#return; {724#true} is VALID [2022-04-27 13:18:01,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-27 13:18:01,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#true} assume !(0 == ~cond); {724#true} is VALID [2022-04-27 13:18:01,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#true} ~cond := #in~cond; {724#true} is VALID [2022-04-27 13:18:01,400 INFO L272 TraceCheckUtils]: 11: Hoare triple {724#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)); {724#true} is VALID [2022-04-27 13:18:01,400 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {724#true} {724#true} #59#return; {724#true} is VALID [2022-04-27 13:18:01,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-27 13:18:01,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#true} assume !(0 == ~cond); {724#true} is VALID [2022-04-27 13:18:01,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {724#true} ~cond := #in~cond; {724#true} is VALID [2022-04-27 13:18:01,401 INFO L272 TraceCheckUtils]: 6: Hoare triple {724#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {724#true} is VALID [2022-04-27 13:18:01,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#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; {724#true} is VALID [2022-04-27 13:18:01,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret7 := main(); {724#true} is VALID [2022-04-27 13:18:01,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #67#return; {724#true} is VALID [2022-04-27 13:18:01,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-27 13:18:01,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#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; {724#true} is VALID [2022-04-27 13:18:01,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {724#true} is VALID [2022-04-27 13:18:01,402 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:18:01,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:01,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098239727] [2022-04-27 13:18:01,402 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:01,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067573322] [2022-04-27 13:18:01,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067573322] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:01,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:01,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 13:18:01,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123425336] [2022-04-27 13:18:01,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:01,403 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:18:01,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:01,404 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:18:01,425 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:18:01,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:18:01,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:01,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:18:01,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:18:01,426 INFO L87 Difference]: Start difference. First operand 36 states and 43 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:18:01,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:01,694 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-27 13:18:01,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:18:01,694 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:18:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:01,695 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:18:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 13:18:01,696 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:18:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 13:18:01,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-27 13:18:01,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:01,747 INFO L225 Difference]: With dead ends: 43 [2022-04-27 13:18:01,747 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 13:18:01,747 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:18:01,748 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:01,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 109 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:18:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 13:18:01,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2022-04-27 13:18:01,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:01,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:01,762 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:01,762 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:01,764 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-27 13:18:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-27 13:18:01,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:01,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:01,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 38 states. [2022-04-27 13:18:01,765 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 38 states. [2022-04-27 13:18:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:01,766 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-27 13:18:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-27 13:18:01,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:01,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:01,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:01,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-27 13:18:01,769 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-27 13:18:01,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:01,769 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-27 13:18:01,769 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:18:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-27 13:18:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 13:18:01,770 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:01,770 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] [2022-04-27 13:18:01,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:18:01,993 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:18:01,993 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:01,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:01,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-27 13:18:01,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:01,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68897642] [2022-04-27 13:18:01,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:01,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:02,005 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:02,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479603503] [2022-04-27 13:18:02,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:02,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:02,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:02,006 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:18:02,023 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:18:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:02,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:18:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:02,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:02,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {1091#true} call ULTIMATE.init(); {1091#true} is VALID [2022-04-27 13:18:02,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {1091#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; {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#(<= ~counter~0 0)} assume true; {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#(<= ~counter~0 0)} {1091#true} #67#return; {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#(<= ~counter~0 0)} call #t~ret7 := main(); {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#(<= ~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; {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {1099#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#(<= ~counter~0 0)} ~cond := #in~cond; {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#(<= ~counter~0 0)} assume !(0 == ~cond); {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {1099#(<= ~counter~0 0)} assume true; {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1099#(<= ~counter~0 0)} {1099#(<= ~counter~0 0)} #59#return; {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,219 INFO L272 TraceCheckUtils]: 11: Hoare triple {1099#(<= ~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)); {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {1099#(<= ~counter~0 0)} ~cond := #in~cond; {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {1099#(<= ~counter~0 0)} assume !(0 == ~cond); {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {1099#(<= ~counter~0 0)} assume true; {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,220 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1099#(<= ~counter~0 0)} {1099#(<= ~counter~0 0)} #61#return; {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {1099#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1099#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:02,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {1099#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1148#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:02,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {1148#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1148#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:02,224 INFO L272 TraceCheckUtils]: 19: Hoare triple {1148#(<= ~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)); {1148#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:02,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {1148#(<= ~counter~0 1)} ~cond := #in~cond; {1148#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:02,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {1148#(<= ~counter~0 1)} assume !(0 == ~cond); {1148#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:02,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {1148#(<= ~counter~0 1)} assume true; {1148#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:02,226 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1148#(<= ~counter~0 1)} {1148#(<= ~counter~0 1)} #63#return; {1148#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:02,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {1148#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1148#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:02,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {1148#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1148#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:02,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {1148#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1176#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:18:02,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {1176#(<= |main_#t~post6| 1)} assume !(#t~post6 < 10);havoc #t~post6; {1092#false} is VALID [2022-04-27 13:18:02,228 INFO L272 TraceCheckUtils]: 28: Hoare triple {1092#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)); {1092#false} is VALID [2022-04-27 13:18:02,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {1092#false} ~cond := #in~cond; {1092#false} is VALID [2022-04-27 13:18:02,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {1092#false} assume 0 == ~cond; {1092#false} is VALID [2022-04-27 13:18:02,229 INFO L290 TraceCheckUtils]: 31: Hoare triple {1092#false} assume !false; {1092#false} is VALID [2022-04-27 13:18:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:02,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:02,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {1092#false} assume !false; {1092#false} is VALID [2022-04-27 13:18:02,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {1092#false} assume 0 == ~cond; {1092#false} is VALID [2022-04-27 13:18:02,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {1092#false} ~cond := #in~cond; {1092#false} is VALID [2022-04-27 13:18:02,389 INFO L272 TraceCheckUtils]: 28: Hoare triple {1092#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)); {1092#false} is VALID [2022-04-27 13:18:02,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {1204#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {1092#false} is VALID [2022-04-27 13:18:02,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {1208#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1204#(< |main_#t~post6| 10)} is VALID [2022-04-27 13:18:02,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {1208#(< ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1208#(< ~counter~0 10)} is VALID [2022-04-27 13:18:02,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {1208#(< ~counter~0 10)} assume !!(0 != ~r~0); {1208#(< ~counter~0 10)} is VALID [2022-04-27 13:18:02,391 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1091#true} {1208#(< ~counter~0 10)} #63#return; {1208#(< ~counter~0 10)} is VALID [2022-04-27 13:18:02,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {1091#true} assume true; {1091#true} is VALID [2022-04-27 13:18:02,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {1091#true} assume !(0 == ~cond); {1091#true} is VALID [2022-04-27 13:18:02,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {1091#true} ~cond := #in~cond; {1091#true} is VALID [2022-04-27 13:18:02,392 INFO L272 TraceCheckUtils]: 19: Hoare triple {1208#(< ~counter~0 10)} 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)); {1091#true} is VALID [2022-04-27 13:18:02,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {1208#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {1208#(< ~counter~0 10)} is VALID [2022-04-27 13:18:02,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {1236#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1208#(< ~counter~0 10)} is VALID [2022-04-27 13:18:02,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {1236#(< ~counter~0 9)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1236#(< ~counter~0 9)} is VALID [2022-04-27 13:18:02,394 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1091#true} {1236#(< ~counter~0 9)} #61#return; {1236#(< ~counter~0 9)} is VALID [2022-04-27 13:18:02,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {1091#true} assume true; {1091#true} is VALID [2022-04-27 13:18:02,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {1091#true} assume !(0 == ~cond); {1091#true} is VALID [2022-04-27 13:18:02,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {1091#true} ~cond := #in~cond; {1091#true} is VALID [2022-04-27 13:18:02,395 INFO L272 TraceCheckUtils]: 11: Hoare triple {1236#(< ~counter~0 9)} 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)); {1091#true} is VALID [2022-04-27 13:18:02,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1091#true} {1236#(< ~counter~0 9)} #59#return; {1236#(< ~counter~0 9)} is VALID [2022-04-27 13:18:02,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {1091#true} assume true; {1091#true} is VALID [2022-04-27 13:18:02,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {1091#true} assume !(0 == ~cond); {1091#true} is VALID [2022-04-27 13:18:02,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {1091#true} ~cond := #in~cond; {1091#true} is VALID [2022-04-27 13:18:02,397 INFO L272 TraceCheckUtils]: 6: Hoare triple {1236#(< ~counter~0 9)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1091#true} is VALID [2022-04-27 13:18:02,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {1236#(< ~counter~0 9)} 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; {1236#(< ~counter~0 9)} is VALID [2022-04-27 13:18:02,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {1236#(< ~counter~0 9)} call #t~ret7 := main(); {1236#(< ~counter~0 9)} is VALID [2022-04-27 13:18:02,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1236#(< ~counter~0 9)} {1091#true} #67#return; {1236#(< ~counter~0 9)} is VALID [2022-04-27 13:18:02,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {1236#(< ~counter~0 9)} assume true; {1236#(< ~counter~0 9)} is VALID [2022-04-27 13:18:02,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {1091#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; {1236#(< ~counter~0 9)} is VALID [2022-04-27 13:18:02,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {1091#true} call ULTIMATE.init(); {1091#true} is VALID [2022-04-27 13:18:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:02,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:02,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68897642] [2022-04-27 13:18:02,403 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:02,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479603503] [2022-04-27 13:18:02,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479603503] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:02,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:02,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 13:18:02,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376528188] [2022-04-27 13:18:02,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:02,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-27 13:18:02,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:02,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 13:18:02,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:02,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:18:02,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:02,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:18:02,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:18:02,447 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 13:18:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:02,608 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-27 13:18:02,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:18:02,609 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-27 13:18:02,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 13:18:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 13:18:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 13:18:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 13:18:02,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-27 13:18:02,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:02,679 INFO L225 Difference]: With dead ends: 61 [2022-04-27 13:18:02,680 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 13:18:02,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:18:02,681 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:02,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 94 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:18:02,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 13:18:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 13:18:02,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:02,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:18:02,699 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:18:02,699 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:18:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:02,701 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-27 13:18:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 13:18:02,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:02,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:02,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-27 13:18:02,702 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-27 13:18:02,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:02,705 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-27 13:18:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 13:18:02,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:02,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:02,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:02,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:18:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-27 13:18:02,708 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-27 13:18:02,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:02,708 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-27 13:18:02,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 13:18:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 13:18:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 13:18:02,709 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:02,709 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:02,738 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:18:02,935 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:18:02,935 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:02,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 2 times [2022-04-27 13:18:02,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:02,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889424007] [2022-04-27 13:18:02,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:02,950 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:02,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502020390] [2022-04-27 13:18:02,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:18:02,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:02,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:02,951 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:18:02,957 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:18:03,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:18:03,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:18:03,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:18:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:03,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:03,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {1571#true} call ULTIMATE.init(); {1571#true} is VALID [2022-04-27 13:18:03,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {1571#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; {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {1579#(<= ~counter~0 0)} assume true; {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1579#(<= ~counter~0 0)} {1571#true} #67#return; {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {1579#(<= ~counter~0 0)} call #t~ret7 := main(); {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {1579#(<= ~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; {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,357 INFO L272 TraceCheckUtils]: 6: Hoare triple {1579#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {1579#(<= ~counter~0 0)} ~cond := #in~cond; {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {1579#(<= ~counter~0 0)} assume !(0 == ~cond); {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {1579#(<= ~counter~0 0)} assume true; {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,363 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1579#(<= ~counter~0 0)} {1579#(<= ~counter~0 0)} #59#return; {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,363 INFO L272 TraceCheckUtils]: 11: Hoare triple {1579#(<= ~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)); {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {1579#(<= ~counter~0 0)} ~cond := #in~cond; {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {1579#(<= ~counter~0 0)} assume !(0 == ~cond); {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {1579#(<= ~counter~0 0)} assume true; {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,365 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1579#(<= ~counter~0 0)} {1579#(<= ~counter~0 0)} #61#return; {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {1579#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1579#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:03,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {1579#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1628#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:03,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {1628#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1628#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:03,367 INFO L272 TraceCheckUtils]: 19: Hoare triple {1628#(<= ~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)); {1628#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:03,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {1628#(<= ~counter~0 1)} ~cond := #in~cond; {1628#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:03,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {1628#(<= ~counter~0 1)} assume !(0 == ~cond); {1628#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:03,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {1628#(<= ~counter~0 1)} assume true; {1628#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:03,368 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1628#(<= ~counter~0 1)} {1628#(<= ~counter~0 1)} #63#return; {1628#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:03,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {1628#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1628#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:03,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {1628#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1628#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:03,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {1628#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1656#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:03,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {1656#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {1656#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:03,371 INFO L272 TraceCheckUtils]: 28: Hoare triple {1656#(<= ~counter~0 2)} 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)); {1656#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:03,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {1656#(<= ~counter~0 2)} ~cond := #in~cond; {1656#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:03,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {1656#(<= ~counter~0 2)} assume !(0 == ~cond); {1656#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:03,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {1656#(<= ~counter~0 2)} assume true; {1656#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:03,372 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1656#(<= ~counter~0 2)} {1656#(<= ~counter~0 2)} #63#return; {1656#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:03,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {1656#(<= ~counter~0 2)} assume !!(0 != ~r~0); {1656#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:03,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {1656#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1656#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:03,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {1656#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1684#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:03,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {1684#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {1684#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:03,375 INFO L272 TraceCheckUtils]: 37: Hoare triple {1684#(<= ~counter~0 3)} 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)); {1684#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:03,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {1684#(<= ~counter~0 3)} ~cond := #in~cond; {1684#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:03,375 INFO L290 TraceCheckUtils]: 39: Hoare triple {1684#(<= ~counter~0 3)} assume !(0 == ~cond); {1684#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:03,376 INFO L290 TraceCheckUtils]: 40: Hoare triple {1684#(<= ~counter~0 3)} assume true; {1684#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:03,376 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1684#(<= ~counter~0 3)} {1684#(<= ~counter~0 3)} #63#return; {1684#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:03,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {1684#(<= ~counter~0 3)} assume !!(0 != ~r~0); {1684#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:03,377 INFO L290 TraceCheckUtils]: 43: Hoare triple {1684#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1684#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:03,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {1684#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1712#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:03,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {1712#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {1712#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:03,378 INFO L272 TraceCheckUtils]: 46: Hoare triple {1712#(<= ~counter~0 4)} 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)); {1712#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:03,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {1712#(<= ~counter~0 4)} ~cond := #in~cond; {1712#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:03,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {1712#(<= ~counter~0 4)} assume !(0 == ~cond); {1712#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:03,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {1712#(<= ~counter~0 4)} assume true; {1712#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:03,380 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1712#(<= ~counter~0 4)} {1712#(<= ~counter~0 4)} #63#return; {1712#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:03,380 INFO L290 TraceCheckUtils]: 51: Hoare triple {1712#(<= ~counter~0 4)} assume !!(0 != ~r~0); {1712#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:03,381 INFO L290 TraceCheckUtils]: 52: Hoare triple {1712#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1712#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:03,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {1712#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1740#(<= |main_#t~post6| 4)} is VALID [2022-04-27 13:18:03,387 INFO L290 TraceCheckUtils]: 54: Hoare triple {1740#(<= |main_#t~post6| 4)} assume !(#t~post6 < 10);havoc #t~post6; {1572#false} is VALID [2022-04-27 13:18:03,387 INFO L272 TraceCheckUtils]: 55: Hoare triple {1572#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)); {1572#false} is VALID [2022-04-27 13:18:03,387 INFO L290 TraceCheckUtils]: 56: Hoare triple {1572#false} ~cond := #in~cond; {1572#false} is VALID [2022-04-27 13:18:03,387 INFO L290 TraceCheckUtils]: 57: Hoare triple {1572#false} assume 0 == ~cond; {1572#false} is VALID [2022-04-27 13:18:03,387 INFO L290 TraceCheckUtils]: 58: Hoare triple {1572#false} assume !false; {1572#false} is VALID [2022-04-27 13:18:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:03,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:03,767 INFO L290 TraceCheckUtils]: 58: Hoare triple {1572#false} assume !false; {1572#false} is VALID [2022-04-27 13:18:03,767 INFO L290 TraceCheckUtils]: 57: Hoare triple {1572#false} assume 0 == ~cond; {1572#false} is VALID [2022-04-27 13:18:03,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {1572#false} ~cond := #in~cond; {1572#false} is VALID [2022-04-27 13:18:03,768 INFO L272 TraceCheckUtils]: 55: Hoare triple {1572#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)); {1572#false} is VALID [2022-04-27 13:18:03,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {1768#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {1572#false} is VALID [2022-04-27 13:18:03,770 INFO L290 TraceCheckUtils]: 53: Hoare triple {1772#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1768#(< |main_#t~post6| 10)} is VALID [2022-04-27 13:18:03,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {1772#(< ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1772#(< ~counter~0 10)} is VALID [2022-04-27 13:18:03,774 INFO L290 TraceCheckUtils]: 51: Hoare triple {1772#(< ~counter~0 10)} assume !!(0 != ~r~0); {1772#(< ~counter~0 10)} is VALID [2022-04-27 13:18:03,775 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1571#true} {1772#(< ~counter~0 10)} #63#return; {1772#(< ~counter~0 10)} is VALID [2022-04-27 13:18:03,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-27 13:18:03,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-27 13:18:03,776 INFO L290 TraceCheckUtils]: 47: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-27 13:18:03,776 INFO L272 TraceCheckUtils]: 46: Hoare triple {1772#(< ~counter~0 10)} 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)); {1571#true} is VALID [2022-04-27 13:18:03,776 INFO L290 TraceCheckUtils]: 45: Hoare triple {1772#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {1772#(< ~counter~0 10)} is VALID [2022-04-27 13:18:03,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {1800#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1772#(< ~counter~0 10)} is VALID [2022-04-27 13:18:03,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {1800#(< ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1800#(< ~counter~0 9)} is VALID [2022-04-27 13:18:03,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {1800#(< ~counter~0 9)} assume !!(0 != ~r~0); {1800#(< ~counter~0 9)} is VALID [2022-04-27 13:18:03,778 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1571#true} {1800#(< ~counter~0 9)} #63#return; {1800#(< ~counter~0 9)} is VALID [2022-04-27 13:18:03,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-27 13:18:03,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-27 13:18:03,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-27 13:18:03,778 INFO L272 TraceCheckUtils]: 37: Hoare triple {1800#(< ~counter~0 9)} 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)); {1571#true} is VALID [2022-04-27 13:18:03,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {1800#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {1800#(< ~counter~0 9)} is VALID [2022-04-27 13:18:03,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1800#(< ~counter~0 9)} is VALID [2022-04-27 13:18:03,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {1828#(< ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1828#(< ~counter~0 8)} is VALID [2022-04-27 13:18:03,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {1828#(< ~counter~0 8)} assume !!(0 != ~r~0); {1828#(< ~counter~0 8)} is VALID [2022-04-27 13:18:03,781 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1571#true} {1828#(< ~counter~0 8)} #63#return; {1828#(< ~counter~0 8)} is VALID [2022-04-27 13:18:03,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-27 13:18:03,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-27 13:18:03,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-27 13:18:03,781 INFO L272 TraceCheckUtils]: 28: Hoare triple {1828#(< ~counter~0 8)} 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)); {1571#true} is VALID [2022-04-27 13:18:03,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {1828#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {1828#(< ~counter~0 8)} is VALID [2022-04-27 13:18:03,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {1856#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1828#(< ~counter~0 8)} is VALID [2022-04-27 13:18:03,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {1856#(< ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1856#(< ~counter~0 7)} is VALID [2022-04-27 13:18:03,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {1856#(< ~counter~0 7)} assume !!(0 != ~r~0); {1856#(< ~counter~0 7)} is VALID [2022-04-27 13:18:03,784 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1571#true} {1856#(< ~counter~0 7)} #63#return; {1856#(< ~counter~0 7)} is VALID [2022-04-27 13:18:03,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-27 13:18:03,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-27 13:18:03,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-27 13:18:03,785 INFO L272 TraceCheckUtils]: 19: Hoare triple {1856#(< ~counter~0 7)} 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)); {1571#true} is VALID [2022-04-27 13:18:03,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {1856#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {1856#(< ~counter~0 7)} is VALID [2022-04-27 13:18:03,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {1884#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1856#(< ~counter~0 7)} is VALID [2022-04-27 13:18:03,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {1884#(< ~counter~0 6)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1884#(< ~counter~0 6)} is VALID [2022-04-27 13:18:03,786 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1571#true} {1884#(< ~counter~0 6)} #61#return; {1884#(< ~counter~0 6)} is VALID [2022-04-27 13:18:03,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-27 13:18:03,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-27 13:18:03,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-27 13:18:03,787 INFO L272 TraceCheckUtils]: 11: Hoare triple {1884#(< ~counter~0 6)} 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)); {1571#true} is VALID [2022-04-27 13:18:03,787 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1571#true} {1884#(< ~counter~0 6)} #59#return; {1884#(< ~counter~0 6)} is VALID [2022-04-27 13:18:03,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-27 13:18:03,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-27 13:18:03,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-27 13:18:03,788 INFO L272 TraceCheckUtils]: 6: Hoare triple {1884#(< ~counter~0 6)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1571#true} is VALID [2022-04-27 13:18:03,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {1884#(< ~counter~0 6)} 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; {1884#(< ~counter~0 6)} is VALID [2022-04-27 13:18:03,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {1884#(< ~counter~0 6)} call #t~ret7 := main(); {1884#(< ~counter~0 6)} is VALID [2022-04-27 13:18:03,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1884#(< ~counter~0 6)} {1571#true} #67#return; {1884#(< ~counter~0 6)} is VALID [2022-04-27 13:18:03,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {1884#(< ~counter~0 6)} assume true; {1884#(< ~counter~0 6)} is VALID [2022-04-27 13:18:03,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {1571#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; {1884#(< ~counter~0 6)} is VALID [2022-04-27 13:18:03,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {1571#true} call ULTIMATE.init(); {1571#true} is VALID [2022-04-27 13:18:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 13:18:03,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:03,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889424007] [2022-04-27 13:18:03,793 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:03,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502020390] [2022-04-27 13:18:03,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502020390] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:03,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:03,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 13:18:03,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807142714] [2022-04-27 13:18:03,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:03,795 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-27 13:18:03,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:03,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:18:03,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:03,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:18:03,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:03,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:18:03,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:18:03,879 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:18:04,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:04,317 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2022-04-27 13:18:04,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 13:18:04,317 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-27 13:18:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:18:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-27 13:18:04,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:18:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-27 13:18:04,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 130 transitions. [2022-04-27 13:18:04,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:04,437 INFO L225 Difference]: With dead ends: 115 [2022-04-27 13:18:04,437 INFO L226 Difference]: Without dead ends: 110 [2022-04-27 13:18:04,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 13:18:04,438 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 80 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:04,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 160 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:18:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-27 13:18:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-27 13:18:04,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:04,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:18:04,485 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:18:04,486 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:18:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:04,489 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-27 13:18:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-27 13:18:04,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:04,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:04,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-27 13:18:04,491 INFO L87 Difference]: Start difference. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-27 13:18:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:04,494 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-27 13:18:04,494 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-27 13:18:04,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:04,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:04,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:04,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:18:04,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-27 13:18:04,499 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-04-27 13:18:04,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:04,499 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-27 13:18:04,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:18:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-27 13:18:04,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-27 13:18:04,502 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:04,502 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:04,526 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:18:04,719 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:18:04,719 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:04,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 3 times [2022-04-27 13:18:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:04,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963719648] [2022-04-27 13:18:04,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:04,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:04,743 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:04,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [850716576] [2022-04-27 13:18:04,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:18:04,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:04,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:04,745 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:18:04,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 13:18:07,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 13:18:07,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 13:18:07,029 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 13:18:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:18:07,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 13:18:07,121 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 13:18:07,122 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:18:07,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 13:18:07,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:07,334 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-04-27 13:18:07,337 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:18:07,434 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:18:07,434 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 13:18:07,434 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:18:07,434 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:18:07,434 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:18:07,434 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 13:18:07,434 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 13:18:07,434 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:18:07,434 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:18:07,434 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:18:07,434 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-27 13:18:07,435 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-27 13:18:07,436 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:18:07,436 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:18:07,436 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 13:18:07,436 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:18:07,436 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:18:07,436 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:18:07,436 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:18:07,436 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 13:18:07,436 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 13:18:07,436 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:18:07,436 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:18:07,436 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:18:07,436 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:18:07,436 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:18:07,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:18:07 BoogieIcfgContainer [2022-04-27 13:18:07,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:18:07,438 INFO L158 Benchmark]: Toolchain (without parser) took 21121.33ms. Allocated memory was 198.2MB in the beginning and 284.2MB in the end (delta: 86.0MB). Free memory was 140.7MB in the beginning and 190.0MB in the end (delta: -49.3MB). Peak memory consumption was 36.6MB. Max. memory is 8.0GB. [2022-04-27 13:18:07,439 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 198.2MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:18:07,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.40ms. Allocated memory is still 198.2MB. Free memory was 140.5MB in the beginning and 166.0MB in the end (delta: -25.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:18:07,439 INFO L158 Benchmark]: Boogie Preprocessor took 22.85ms. Allocated memory is still 198.2MB. Free memory was 166.0MB in the beginning and 164.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:18:07,439 INFO L158 Benchmark]: RCFGBuilder took 236.62ms. Allocated memory is still 198.2MB. Free memory was 164.3MB in the beginning and 153.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 13:18:07,440 INFO L158 Benchmark]: TraceAbstraction took 20638.89ms. Allocated memory was 198.2MB in the beginning and 284.2MB in the end (delta: 86.0MB). Free memory was 152.8MB in the beginning and 190.0MB in the end (delta: -37.2MB). Peak memory consumption was 49.6MB. Max. memory is 8.0GB. [2022-04-27 13:18:07,441 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.30ms. Allocated memory is still 198.2MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.40ms. Allocated memory is still 198.2MB. Free memory was 140.5MB in the beginning and 166.0MB in the end (delta: -25.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.85ms. Allocated memory is still 198.2MB. Free memory was 166.0MB in the beginning and 164.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 236.62ms. Allocated memory is still 198.2MB. Free memory was 164.3MB in the beginning and 153.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 20638.89ms. Allocated memory was 198.2MB in the beginning and 284.2MB in the end (delta: 86.0MB). Free memory was 152.8MB in the beginning and 190.0MB in the end (delta: -37.2MB). Peak memory consumption was 49.6MB. 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)=14, counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] 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] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(counter)=0, A=2603, counter=0, R=52] [L28] 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] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [\old(counter)=0, A=2603, counter=0, R=52] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [\old(counter)=0, A=2603, counter=0, r=101, R=52, u=105, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=2603, counter=1, counter++=0, r=101, R=52, u=105, v=1] [L34] COND TRUE counter++<10 [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=2603, counter=1, r=101, R=52, u=105, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=2603, counter=1, r=101, R=52, u=105, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=2603, counter=1, R=52, r=100, u=105, v=3] [L34] EXPR counter++ VAL [\old(counter)=0, A=2603, counter=2, counter++=1, R=52, r=100, u=105, v=3] [L34] COND TRUE counter++<10 [L35] 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] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=2603, counter=2, r=100, R=52, u=105, v=3] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=2603, counter=2, r=100, R=52, u=105, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=2603, counter=2, R=52, r=97, u=105, v=5] [L34] EXPR counter++ VAL [\old(counter)=0, A=2603, counter=3, counter++=2, r=97, R=52, u=105, v=5] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=2603, counter=3, R=52, r=97, u=105, v=5] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=2603, counter=3, R=52, r=97, u=105, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=2603, counter=3, r=92, R=52, u=105, v=7] [L34] EXPR counter++ VAL [\old(counter)=0, A=2603, counter=4, counter++=3, R=52, r=92, u=105, v=7] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=2603, counter=4, r=92, R=52, u=105, v=7] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=2603, counter=4, r=92, R=52, u=105, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=2603, counter=4, R=52, r=85, u=105, v=9] [L34] EXPR counter++ VAL [\old(counter)=0, A=2603, counter=5, counter++=4, r=85, R=52, u=105, v=9] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=2603, counter=5, R=52, r=85, u=105, v=9] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=2603, counter=5, r=85, R=52, u=105, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=2603, counter=5, r=76, R=52, u=105, v=11] [L34] EXPR counter++ VAL [\old(counter)=0, A=2603, counter=6, counter++=5, r=76, R=52, u=105, v=11] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=2603, counter=6, r=76, R=52, u=105, v=11] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=2603, counter=6, r=76, R=52, u=105, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=2603, counter=6, r=65, R=52, u=105, v=13] [L34] EXPR counter++ VAL [\old(counter)=0, A=2603, counter=7, counter++=6, R=52, r=65, u=105, v=13] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=2603, counter=7, r=65, R=52, u=105, v=13] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=2603, counter=7, r=65, R=52, u=105, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=2603, counter=7, r=52, R=52, u=105, v=15] [L34] EXPR counter++ VAL [\old(counter)=0, A=2603, counter=8, counter++=7, r=52, R=52, u=105, v=15] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=2603, counter=8, R=52, r=52, u=105, v=15] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=2603, counter=8, r=52, R=52, u=105, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=2603, counter=8, R=52, r=37, u=105, v=17] [L34] EXPR counter++ VAL [\old(counter)=0, A=2603, counter=9, counter++=8, R=52, r=37, u=105, v=17] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=2603, counter=9, r=37, R=52, u=105, v=17] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=2603, counter=9, R=52, r=37, u=105, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=2603, counter=9, r=20, R=52, u=105, v=19] [L34] EXPR counter++ VAL [\old(counter)=0, A=2603, counter=10, counter++=9, r=20, R=52, u=105, v=19] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=2603, counter=10, R=52, r=20, u=105, v=19] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=2603, counter=10, r=20, R=52, u=105, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=2603, counter=10, r=1, R=52, u=105, v=21] [L34] EXPR counter++ VAL [\old(counter)=0, A=2603, counter=11, counter++=10, R=52, r=1, u=105, v=21] [L34] COND FALSE !(counter++<10) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] [L14] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 549 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 379 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 170 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=6, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 779 SizeOfPredicates, 17 NumberOfNonLiveVariables, 665 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 82/188 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:18:07,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...