/usr/bin/java -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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-23 18:17:14,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-23 18:17:14,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-23 18:17:14,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-23 18:17:14,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-23 18:17:14,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-23 18:17:14,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-23 18:17:14,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-23 18:17:14,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-23 18:17:14,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-23 18:17:14,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-23 18:17:14,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-23 18:17:14,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-23 18:17:14,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-23 18:17:14,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-23 18:17:14,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-23 18:17:14,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-23 18:17:14,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-23 18:17:14,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-23 18:17:14,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-23 18:17:14,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-23 18:17:14,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-23 18:17:14,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-23 18:17:14,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-23 18:17:14,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-23 18:17:14,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-23 18:17:14,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-23 18:17:14,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-23 18:17:14,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-23 18:17:14,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-23 18:17:14,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-23 18:17:14,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-23 18:17:14,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-23 18:17:14,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-23 18:17:14,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-23 18:17:14,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-23 18:17:14,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-23 18:17:14,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-23 18:17:14,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-23 18:17:14,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-23 18:17:14,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-23 18:17:14,523 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-23 18:17:14,530 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-23 18:17:14,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-23 18:17:14,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-23 18:17:14,531 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-23 18:17:14,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-23 18:17:14,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-23 18:17:14,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-23 18:17:14,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-23 18:17:14,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-23 18:17:14,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-23 18:17:14,532 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-23 18:17:14,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-23 18:17:14,533 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-23 18:17:14,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-23 18:17:14,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-23 18:17:14,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-23 18:17:14,533 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-23 18:17:14,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-23 18:17:14,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-23 18:17:14,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-23 18:17:14,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-23 18:17:14,534 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-23 18:17:14,534 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-02-23 18:17:14,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-23 18:17:14,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-23 18:17:14,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-23 18:17:14,754 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-23 18:17:14,755 INFO L275 PluginConnector]: CDTParser initialized [2022-02-23 18:17:14,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2022-02-23 18:17:14,810 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3e8374d/b73edbf7e10141f1a3aa69c33113be6c/FLAG2c3aadb4c [2022-02-23 18:17:15,196 INFO L306 CDTParser]: Found 1 translation units. [2022-02-23 18:17:15,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2022-02-23 18:17:15,204 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3e8374d/b73edbf7e10141f1a3aa69c33113be6c/FLAG2c3aadb4c [2022-02-23 18:17:15,215 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3e8374d/b73edbf7e10141f1a3aa69c33113be6c [2022-02-23 18:17:15,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-23 18:17:15,217 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-23 18:17:15,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-23 18:17:15,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-23 18:17:15,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-23 18:17:15,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 06:17:15" (1/1) ... [2022-02-23 18:17:15,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677a48b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:17:15, skipping insertion in model container [2022-02-23 18:17:15,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 06:17:15" (1/1) ... [2022-02-23 18:17:15,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-23 18:17:15,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-23 18:17:15,359 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_unwindbound20.c[524,537] [2022-02-23 18:17:15,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-23 18:17:15,381 INFO L203 MainTranslator]: Completed pre-run [2022-02-23 18:17:15,390 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_unwindbound20.c[524,537] [2022-02-23 18:17:15,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-23 18:17:15,413 INFO L208 MainTranslator]: Completed translation [2022-02-23 18:17:15,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:17:15 WrapperNode [2022-02-23 18:17:15,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-23 18:17:15,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-23 18:17:15,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-23 18:17:15,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-23 18:17:15,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:17:15" (1/1) ... [2022-02-23 18:17:15,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:17:15" (1/1) ... [2022-02-23 18:17:15,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:17:15" (1/1) ... [2022-02-23 18:17:15,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:17:15" (1/1) ... [2022-02-23 18:17:15,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:17:15" (1/1) ... [2022-02-23 18:17:15,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:17:15" (1/1) ... [2022-02-23 18:17:15,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:17:15" (1/1) ... [2022-02-23 18:17:15,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-23 18:17:15,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-23 18:17:15,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-23 18:17:15,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-23 18:17:15,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:17:15" (1/1) ... [2022-02-23 18:17:15,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-23 18:17:15,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:15,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-23 18:17:15,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-23 18:17:15,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-23 18:17:15,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-23 18:17:15,516 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-23 18:17:15,517 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-23 18:17:15,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-23 18:17:15,517 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-23 18:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-23 18:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-23 18:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-23 18:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-23 18:17:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-23 18:17:15,518 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-23 18:17:15,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-23 18:17:15,518 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-23 18:17:15,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-23 18:17:15,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-23 18:17:15,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-23 18:17:15,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-23 18:17:15,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-23 18:17:15,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-23 18:17:15,558 INFO L234 CfgBuilder]: Building ICFG [2022-02-23 18:17:15,559 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-23 18:17:15,657 INFO L275 CfgBuilder]: Performing block encoding [2022-02-23 18:17:15,677 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-23 18:17:15,677 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-23 18:17:15,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 06:17:15 BoogieIcfgContainer [2022-02-23 18:17:15,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-23 18:17:15,679 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-23 18:17:15,679 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-23 18:17:15,680 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-23 18:17:15,682 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 06:17:15" (1/1) ... [2022-02-23 18:17:15,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.02 06:17:15 BasicIcfg [2022-02-23 18:17:15,693 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-23 18:17:15,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-23 18:17:15,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-23 18:17:15,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-23 18:17:15,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.02 06:17:15" (1/4) ... [2022-02-23 18:17:15,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc6269a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 06:17:15, skipping insertion in model container [2022-02-23 18:17:15,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:17:15" (2/4) ... [2022-02-23 18:17:15,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc6269a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 06:17:15, skipping insertion in model container [2022-02-23 18:17:15,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 06:17:15" (3/4) ... [2022-02-23 18:17:15,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc6269a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.02 06:17:15, skipping insertion in model container [2022-02-23 18:17:15,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.02 06:17:15" (4/4) ... [2022-02-23 18:17:15,709 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.cJordan [2022-02-23 18:17:15,712 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-23 18:17:15,712 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-23 18:17:15,767 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-23 18:17:15,788 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-23 18:17:15,788 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-23 18:17:15,796 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-02-23 18:17:15,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-23 18:17:15,801 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:15,801 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 18:17:15,801 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:15,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:15,815 INFO L85 PathProgramCache]: Analyzing trace with hash 734203501, now seen corresponding path program 1 times [2022-02-23 18:17:15,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:15,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000428839] [2022-02-23 18:17:15,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:15,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:15,905 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:15,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591108501] [2022-02-23 18:17:15,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:15,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:15,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:15,908 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 18:17:15,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-23 18:17:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 18:17:15,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-23 18:17:15,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-23 18:17:16,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 18:17:16,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:16,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000428839] [2022-02-23 18:17:16,054 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:16,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591108501] [2022-02-23 18:17:16,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591108501] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 18:17:16,055 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 18:17:16,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-23 18:17:16,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427473130] [2022-02-23 18:17:16,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 18:17:16,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-23 18:17:16,060 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:16,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-23 18:17:16,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-23 18:17:16,086 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-02-23 18:17:16,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:16,097 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-23 18:17:16,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-23 18:17:16,100 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-02-23 18:17:16,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:16,104 INFO L225 Difference]: With dead ends: 30 [2022-02-23 18:17:16,104 INFO L226 Difference]: Without dead ends: 25 [2022-02-23 18:17:16,105 INFO L932 BasicCegarLoop]: 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-02-23 18:17:16,110 INFO L933 BasicCegarLoop]: 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-02-23 18:17:16,111 INFO L934 BasicCegarLoop]: 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-02-23 18:17:16,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-23 18:17:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-23 18:17:16,134 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-02-23 18:17:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-02-23 18:17:16,137 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-02-23 18:17:16,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:16,137 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-02-23 18:17:16,137 INFO L471 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-02-23 18:17:16,137 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-23 18:17:16,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-23 18:17:16,139 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:16,139 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 18:17:16,159 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-02-23 18:17:16,351 WARN L452 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-02-23 18:17:16,352 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:16,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1669026344, now seen corresponding path program 1 times [2022-02-23 18:17:16,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:16,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707780004] [2022-02-23 18:17:16,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:16,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:16,367 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:16,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [906803356] [2022-02-23 18:17:16,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:16,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:16,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:16,368 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 18:17:16,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-23 18:17:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 18:17:16,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-23 18:17:16,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 18:17:16,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 18:17:16,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:16,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707780004] [2022-02-23 18:17:16,482 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:16,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906803356] [2022-02-23 18:17:16,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906803356] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 18:17:16,482 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 18:17:16,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-23 18:17:16,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904725223] [2022-02-23 18:17:16,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 18:17:16,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-23 18:17:16,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:16,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-23 18:17:16,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-23 18:17:16,484 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-02-23 18:17:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:16,492 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-23 18:17:16,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-23 18:17:16,493 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-02-23 18:17:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:16,493 INFO L225 Difference]: With dead ends: 27 [2022-02-23 18:17:16,494 INFO L226 Difference]: Without dead ends: 27 [2022-02-23 18:17:16,494 INFO L932 BasicCegarLoop]: 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-02-23 18:17:16,495 INFO L933 BasicCegarLoop]: 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-02-23 18:17:16,495 INFO L934 BasicCegarLoop]: 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-02-23 18:17:16,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-23 18:17:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-23 18:17:16,506 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-02-23 18:17:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-02-23 18:17:16,507 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-02-23 18:17:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:16,508 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-02-23 18:17:16,508 INFO L471 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-02-23 18:17:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-23 18:17:16,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-23 18:17:16,509 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:16,509 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 18:17:16,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-23 18:17:16,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-02-23 18:17:16,736 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:16,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1667953868, now seen corresponding path program 1 times [2022-02-23 18:17:16,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:16,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853161031] [2022-02-23 18:17:16,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:16,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:16,747 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:16,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1147617670] [2022-02-23 18:17:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:16,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:16,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:16,749 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-02-23 18:17:16,750 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-02-23 18:17:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 18:17:16,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-23 18:17:16,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 18:17:17,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 18:17:17,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:17,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853161031] [2022-02-23 18:17:17,037 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:17,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147617670] [2022-02-23 18:17:17,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147617670] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 18:17:17,037 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 18:17:17,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-23 18:17:17,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981913945] [2022-02-23 18:17:17,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 18:17:17,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-23 18:17:17,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:17,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-23 18:17:17,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-23 18:17:17,039 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-02-23 18:17:19,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-23 18:17:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:19,087 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-23 18:17:19,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-23 18:17:19,088 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-02-23 18:17:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:19,089 INFO L225 Difference]: With dead ends: 35 [2022-02-23 18:17:19,089 INFO L226 Difference]: Without dead ends: 35 [2022-02-23 18:17:19,089 INFO L932 BasicCegarLoop]: 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-02-23 18:17:19,090 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-23 18:17:19,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-02-23 18:17:19,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-23 18:17:19,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-02-23 18:17:19,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-23 18:17:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-02-23 18:17:19,098 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-02-23 18:17:19,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:19,098 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-02-23 18:17:19,098 INFO L471 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-02-23 18:17:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-23 18:17:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-23 18:17:19,099 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:19,099 INFO L514 BasicCegarLoop]: 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-02-23 18:17:19,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-23 18:17:19,308 WARN L452 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-02-23 18:17:19,309 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:19,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:19,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1179905874, now seen corresponding path program 1 times [2022-02-23 18:17:19,310 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:19,310 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666256818] [2022-02-23 18:17:19,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:19,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:19,320 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:19,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1990148307] [2022-02-23 18:17:19,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:19,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:19,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:19,332 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-02-23 18:17:19,368 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-02-23 18:17:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 18:17:19,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-23 18:17:19,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 18:17:19,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 18:17:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 18:17:19,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:19,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666256818] [2022-02-23 18:17:19,670 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:19,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990148307] [2022-02-23 18:17:19,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990148307] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 18:17:19,671 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 18:17:19,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-02-23 18:17:19,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999409656] [2022-02-23 18:17:19,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 18:17:19,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-23 18:17:19,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:19,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-23 18:17:19,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-23 18:17:19,672 INFO L87 Difference]: Start difference. First operand 32 states and 36 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-02-23 18:17:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:19,812 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-02-23 18:17:19,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-23 18:17:19,813 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-02-23 18:17:19,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:19,814 INFO L225 Difference]: With dead ends: 37 [2022-02-23 18:17:19,814 INFO L226 Difference]: Without dead ends: 34 [2022-02-23 18:17:19,815 INFO L932 BasicCegarLoop]: 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-02-23 18:17:19,815 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 18:17:19,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 112 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 18:17:19,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-23 18:17:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-02-23 18:17:19,818 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-02-23 18:17:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-02-23 18:17:19,819 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-02-23 18:17:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:19,819 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-02-23 18:17:19,819 INFO L471 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-02-23 18:17:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-23 18:17:19,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-23 18:17:19,820 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:19,820 INFO L514 BasicCegarLoop]: 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-02-23 18:17:19,838 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-02-23 18:17:20,020 WARN L452 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-02-23 18:17:20,021 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:20,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1668946595, now seen corresponding path program 1 times [2022-02-23 18:17:20,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:20,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313953116] [2022-02-23 18:17:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:20,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:20,028 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:20,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160610832] [2022-02-23 18:17:20,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:20,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:20,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:20,030 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-02-23 18:17:20,031 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-02-23 18:17:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 18:17:20,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-23 18:17:20,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 18:17:20,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 18:17:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 18:17:20,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:20,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313953116] [2022-02-23 18:17:20,177 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:20,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160610832] [2022-02-23 18:17:20,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160610832] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 18:17:20,177 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 18:17:20,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-23 18:17:20,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053040317] [2022-02-23 18:17:20,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 18:17:20,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-23 18:17:20,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:20,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-23 18:17:20,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-23 18:17:20,178 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-02-23 18:17:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:20,221 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-02-23 18:17:20,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-23 18:17:20,221 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-02-23 18:17:20,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:20,222 INFO L225 Difference]: With dead ends: 56 [2022-02-23 18:17:20,222 INFO L226 Difference]: Without dead ends: 56 [2022-02-23 18:17:20,222 INFO L932 BasicCegarLoop]: 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-02-23 18:17:20,223 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 39 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 18:17:20,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 94 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 18:17:20,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-23 18:17:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-23 18:17:20,227 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-02-23 18:17:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-02-23 18:17:20,228 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-02-23 18:17:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:20,228 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-02-23 18:17:20,228 INFO L471 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-02-23 18:17:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-02-23 18:17:20,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-23 18:17:20,229 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:20,229 INFO L514 BasicCegarLoop]: 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-02-23 18:17:20,261 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-02-23 18:17:20,462 WARN L452 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-02-23 18:17:20,463 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:20,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:20,463 INFO L85 PathProgramCache]: Analyzing trace with hash -906969448, now seen corresponding path program 2 times [2022-02-23 18:17:20,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:20,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675000292] [2022-02-23 18:17:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:20,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:20,475 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:20,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [110681092] [2022-02-23 18:17:20,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 18:17:20,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:20,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:20,476 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-02-23 18:17:20,477 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-02-23 18:17:20,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 18:17:20,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 18:17:20,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-23 18:17:20,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 18:17:20,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 18:17:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-23 18:17:20,752 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:20,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675000292] [2022-02-23 18:17:20,753 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:20,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110681092] [2022-02-23 18:17:20,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110681092] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 18:17:20,753 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 18:17:20,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-02-23 18:17:20,753 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22554646] [2022-02-23 18:17:20,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 18:17:20,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-23 18:17:20,754 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:20,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-23 18:17:20,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-23 18:17:20,755 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-02-23 18:17:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:20,885 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-02-23 18:17:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-23 18:17:20,886 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-02-23 18:17:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:20,887 INFO L225 Difference]: With dead ends: 110 [2022-02-23 18:17:20,887 INFO L226 Difference]: Without dead ends: 110 [2022-02-23 18:17:20,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-02-23 18:17:20,888 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 102 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 18:17:20,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 142 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 18:17:20,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-02-23 18:17:20,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-02-23 18:17:20,893 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-02-23 18:17:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-02-23 18:17:20,895 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-02-23 18:17:20,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:20,895 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-02-23 18:17:20,895 INFO L471 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-02-23 18:17:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-02-23 18:17:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-23 18:17:20,897 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:20,897 INFO L514 BasicCegarLoop]: 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-02-23 18:17:20,914 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-02-23 18:17:21,113 WARN L452 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-02-23 18:17:21,114 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:21,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:21,114 INFO L85 PathProgramCache]: Analyzing trace with hash 191644600, now seen corresponding path program 3 times [2022-02-23 18:17:21,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:21,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503376673] [2022-02-23 18:17:21,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:21,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:21,131 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:21,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1632113299] [2022-02-23 18:17:21,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-23 18:17:21,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:21,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:21,132 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-02-23 18:17:21,133 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-02-23 18:17:23,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-23 18:17:23,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 18:17:23,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-23 18:17:23,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 18:17:23,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 18:17:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-02-23 18:17:23,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:23,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503376673] [2022-02-23 18:17:23,718 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:23,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632113299] [2022-02-23 18:17:23,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632113299] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 18:17:23,718 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 18:17:23,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-02-23 18:17:23,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780701675] [2022-02-23 18:17:23,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 18:17:23,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-23 18:17:23,722 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:23,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-23 18:17:23,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-02-23 18:17:23,723 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-02-23 18:17:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:24,027 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-02-23 18:17:24,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-23 18:17:24,029 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) Word has length 113 [2022-02-23 18:17:24,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:24,033 INFO L225 Difference]: With dead ends: 200 [2022-02-23 18:17:24,033 INFO L226 Difference]: Without dead ends: 200 [2022-02-23 18:17:24,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-02-23 18:17:24,036 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 236 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 18:17:24,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 228 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 18:17:24,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-23 18:17:24,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-02-23 18:17:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-23 18:17:24,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2022-02-23 18:17:24,055 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 113 [2022-02-23 18:17:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:24,056 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2022-02-23 18:17:24,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-02-23 18:17:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-02-23 18:17:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-02-23 18:17:24,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:24,058 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 18:17:24,065 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-02-23 18:17:24,258 WARN L452 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-02-23 18:17:24,259 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:24,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:24,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2040315496, now seen corresponding path program 4 times [2022-02-23 18:17:24,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:24,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504544475] [2022-02-23 18:17:24,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:24,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:24,289 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:24,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1338611435] [2022-02-23 18:17:24,289 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-23 18:17:24,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:24,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:24,291 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 18:17:24,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-23 18:17:24,481 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-23 18:17:24,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-23 18:17:24,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-23 18:17:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-23 18:17:24,702 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-23 18:17:24,702 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-23 18:17:24,703 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-23 18:17:24,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-23 18:17:24,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-02-23 18:17:24,912 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2022-02-23 18:17:24,914 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-23 18:17:24,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.02 06:17:24 BasicIcfg [2022-02-23 18:17:24,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-23 18:17:24,971 INFO L158 Benchmark]: Toolchain (without parser) took 9753.27ms. Allocated memory was 166.7MB in the beginning and 200.3MB in the end (delta: 33.6MB). Free memory was 115.6MB in the beginning and 158.0MB in the end (delta: -42.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-23 18:17:24,971 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 166.7MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-23 18:17:24,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.75ms. Allocated memory is still 166.7MB. Free memory was 115.3MB in the beginning and 142.1MB in the end (delta: -26.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-23 18:17:24,971 INFO L158 Benchmark]: Boogie Preprocessor took 28.86ms. Allocated memory is still 166.7MB. Free memory was 142.1MB in the beginning and 140.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-23 18:17:24,971 INFO L158 Benchmark]: RCFGBuilder took 234.79ms. Allocated memory is still 166.7MB. Free memory was 140.6MB in the beginning and 130.6MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-02-23 18:17:24,972 INFO L158 Benchmark]: IcfgTransformer took 13.85ms. Allocated memory is still 166.7MB. Free memory was 130.3MB in the beginning and 129.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-23 18:17:24,972 INFO L158 Benchmark]: TraceAbstraction took 9276.72ms. Allocated memory was 166.7MB in the beginning and 200.3MB in the end (delta: 33.6MB). Free memory was 128.8MB in the beginning and 158.0MB in the end (delta: -29.2MB). Peak memory consumption was 5.6MB. Max. memory is 8.0GB. [2022-02-23 18:17:24,973 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 166.7MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.75ms. Allocated memory is still 166.7MB. Free memory was 115.3MB in the beginning and 142.1MB in the end (delta: -26.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.86ms. Allocated memory is still 166.7MB. Free memory was 142.1MB in the beginning and 140.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 234.79ms. Allocated memory is still 166.7MB. Free memory was 140.6MB in the beginning and 130.6MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 13.85ms. Allocated memory is still 166.7MB. Free memory was 130.3MB in the beginning and 129.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 9276.72ms. Allocated memory was 166.7MB in the beginning and 200.3MB in the end (delta: 33.6MB). Free memory was 128.8MB in the beginning and 158.0MB in the end (delta: -29.2MB). Peak memory consumption was 5.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)=26, 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=33127, counter=0, R=183] [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=33127, counter=0, R=183] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [\old(counter)=0, A=33127, counter=0, r=362, R=183, u=367, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=1, counter++=0, R=183, r=362, u=367, v=1] [L34] COND TRUE counter++<20 [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=33127, counter=1, R=183, r=362, u=367, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=1, R=183, r=362, u=367, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=1, r=361, R=183, u=367, v=3] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=2, counter++=1, r=361, R=183, u=367, v=3] [L34] COND TRUE counter++<20 [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=33127, counter=2, R=183, r=361, u=367, v=3] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=2, R=183, r=361, u=367, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=2, r=358, R=183, u=367, v=5] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=3, counter++=2, r=358, R=183, u=367, v=5] [L34] COND TRUE counter++<20 [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=33127, counter=3, R=183, r=358, u=367, v=5] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=3, r=358, R=183, u=367, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=3, R=183, r=353, u=367, v=7] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=4, counter++=3, r=353, R=183, u=367, v=7] [L34] COND TRUE counter++<20 [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=33127, counter=4, R=183, r=353, u=367, v=7] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=4, r=353, R=183, u=367, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=4, R=183, r=346, u=367, v=9] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=5, counter++=4, r=346, R=183, u=367, v=9] [L34] COND TRUE counter++<20 [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=33127, counter=5, R=183, r=346, u=367, v=9] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=5, R=183, r=346, u=367, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=5, r=337, R=183, u=367, v=11] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=6, counter++=5, R=183, r=337, u=367, v=11] [L34] COND TRUE counter++<20 [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=33127, counter=6, R=183, r=337, u=367, v=11] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=6, r=337, R=183, u=367, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=6, r=326, R=183, u=367, v=13] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=7, counter++=6, r=326, R=183, u=367, v=13] [L34] COND TRUE counter++<20 [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=33127, counter=7, r=326, R=183, u=367, v=13] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=7, r=326, R=183, u=367, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=7, R=183, r=313, u=367, v=15] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=8, counter++=7, R=183, r=313, u=367, v=15] [L34] COND TRUE counter++<20 [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=33127, counter=8, r=313, R=183, u=367, v=15] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=8, R=183, r=313, u=367, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=8, R=183, r=298, u=367, v=17] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=9, counter++=8, R=183, r=298, u=367, v=17] [L34] COND TRUE counter++<20 [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=33127, counter=9, R=183, r=298, u=367, v=17] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=9, R=183, r=298, u=367, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=9, R=183, r=281, u=367, v=19] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=10, counter++=9, R=183, r=281, u=367, v=19] [L34] COND TRUE counter++<20 [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=33127, counter=10, R=183, r=281, u=367, v=19] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=10, R=183, r=281, u=367, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=10, r=262, R=183, u=367, v=21] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=11, counter++=10, R=183, r=262, u=367, v=21] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=11, R=183, r=262, u=367, v=21] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=11, r=262, R=183, u=367, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=11, R=183, r=241, u=367, v=23] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=12, counter++=11, R=183, r=241, u=367, v=23] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=12, R=183, r=241, u=367, v=23] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=12, r=241, R=183, u=367, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=12, R=183, r=218, u=367, v=25] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=13, counter++=12, r=218, R=183, u=367, v=25] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=13, R=183, r=218, u=367, v=25] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=13, R=183, r=218, u=367, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=13, r=193, R=183, u=367, v=27] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=14, counter++=13, R=183, r=193, u=367, v=27] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=14, R=183, r=193, u=367, v=27] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=14, r=193, R=183, u=367, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=14, R=183, r=166, u=367, v=29] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=15, counter++=14, r=166, R=183, u=367, v=29] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=15, R=183, r=166, u=367, v=29] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=15, r=166, R=183, u=367, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=15, R=183, r=137, u=367, v=31] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=16, counter++=15, r=137, R=183, u=367, v=31] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=16, R=183, r=137, u=367, v=31] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=16, r=137, R=183, u=367, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=16, R=183, r=106, u=367, v=33] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=17, counter++=16, r=106, R=183, u=367, v=33] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=17, r=106, R=183, u=367, v=33] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=17, R=183, r=106, u=367, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=17, r=73, R=183, u=367, v=35] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=18, counter++=17, R=183, r=73, u=367, v=35] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=18, r=73, R=183, u=367, v=35] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=18, r=73, R=183, u=367, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=18, r=38, R=183, u=367, v=37] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=19, counter++=18, r=38, R=183, u=367, v=37] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=19, r=38, R=183, u=367, v=37] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=19, r=38, R=183, u=367, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=19, r=1, R=183, u=367, v=39] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=20, counter++=19, R=183, r=1, u=367, v=39] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=33127, counter=20, R=183, r=1, u=367, v=39] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=33127, counter=20, R=183, r=1, u=367, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=33127, counter=20, r=-38, R=183, u=367, v=41] [L34] EXPR counter++ VAL [\old(counter)=0, A=33127, counter=21, counter++=20, r=-38, R=183, u=367, v=41] [L34] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 408 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 407 mSDsluCounter, 765 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 551 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 264 IncrementalHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 214 mSDtfsCounter, 264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 472 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=7, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 523 ConstructedInterpolants, 0 QuantifiedInterpolants, 1335 SizeOfPredicates, 28 NumberOfNonLiveVariables, 958 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 310/1086 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-02-23 18:17:25,004 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...