/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_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-23 18:17:27,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-23 18:17:27,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-23 18:17:27,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-23 18:17:27,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-23 18:17:27,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-23 18:17:27,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-23 18:17:27,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-23 18:17:27,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-23 18:17:27,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-23 18:17:27,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-23 18:17:27,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-23 18:17:27,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-23 18:17:27,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-23 18:17:27,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-23 18:17:27,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-23 18:17:27,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-23 18:17:27,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-23 18:17:27,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-23 18:17:27,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-23 18:17:27,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-23 18:17:27,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-23 18:17:27,870 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-23 18:17:27,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-23 18:17:27,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-23 18:17:27,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-23 18:17:27,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-23 18:17:27,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-23 18:17:27,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-23 18:17:27,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-23 18:17:27,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-23 18:17:27,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-23 18:17:27,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-23 18:17:27,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-23 18:17:27,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-23 18:17:27,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-23 18:17:27,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-23 18:17:27,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-23 18:17:27,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-23 18:17:27,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-23 18:17:27,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-23 18:17:27,884 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:27,895 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-23 18:17:27,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-23 18:17:27,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-23 18:17:27,897 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-23 18:17:27,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-23 18:17:27,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-23 18:17:27,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-23 18:17:27,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-23 18:17:27,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-23 18:17:27,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-23 18:17:27,898 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-23 18:17:27,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-23 18:17:27,898 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-23 18:17:27,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-23 18:17:27,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-23 18:17:27,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-23 18:17:27,898 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-23 18:17:27,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-23 18:17:27,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-23 18:17:27,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-23 18:17:27,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-23 18:17:27,899 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-23 18:17:27,899 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:28,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-23 18:17:28,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-23 18:17:28,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-23 18:17:28,105 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-23 18:17:28,106 INFO L275 PluginConnector]: CDTParser initialized [2022-02-23 18:17:28,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2022-02-23 18:17:28,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb23450b0/50cd55cfd04d45a8ad611d5114678a68/FLAG05e26ff7a [2022-02-23 18:17:28,526 INFO L306 CDTParser]: Found 1 translation units. [2022-02-23 18:17:28,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2022-02-23 18:17:28,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb23450b0/50cd55cfd04d45a8ad611d5114678a68/FLAG05e26ff7a [2022-02-23 18:17:28,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb23450b0/50cd55cfd04d45a8ad611d5114678a68 [2022-02-23 18:17:28,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-23 18:17:28,544 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-23 18:17:28,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-23 18:17:28,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-23 18:17:28,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-23 18:17:28,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 06:17:28" (1/1) ... [2022-02-23 18:17:28,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a64e2e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:17:28, skipping insertion in model container [2022-02-23 18:17:28,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 06:17:28" (1/1) ... [2022-02-23 18:17:28,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-23 18:17:28,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-23 18:17:28,680 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_unwindbound50.c[524,537] [2022-02-23 18:17:28,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-23 18:17:28,696 INFO L203 MainTranslator]: Completed pre-run [2022-02-23 18:17:28,704 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_unwindbound50.c[524,537] [2022-02-23 18:17:28,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-23 18:17:28,716 INFO L208 MainTranslator]: Completed translation [2022-02-23 18:17:28,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:17:28 WrapperNode [2022-02-23 18:17:28,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-23 18:17:28,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-23 18:17:28,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-23 18:17:28,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-23 18:17:28,725 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:28" (1/1) ... [2022-02-23 18:17:28,725 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:28" (1/1) ... [2022-02-23 18:17:28,730 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:28" (1/1) ... [2022-02-23 18:17:28,730 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:28" (1/1) ... [2022-02-23 18:17:28,733 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:28" (1/1) ... [2022-02-23 18:17:28,736 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:28" (1/1) ... [2022-02-23 18:17:28,738 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:28" (1/1) ... [2022-02-23 18:17:28,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-23 18:17:28,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-23 18:17:28,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-23 18:17:28,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-23 18:17:28,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:17:28" (1/1) ... [2022-02-23 18:17:28,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-23 18:17:28,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:28,764 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:28,796 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:28,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-23 18:17:28,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-23 18:17:28,810 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-23 18:17:28,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-23 18:17:28,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-23 18:17:28,810 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-23 18:17:28,810 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-23 18:17:28,811 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-23 18:17:28,811 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-23 18:17:28,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-23 18:17:28,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-23 18:17:28,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-23 18:17:28,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-23 18:17:28,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-23 18:17:28,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-23 18:17:28,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-23 18:17:28,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-23 18:17:28,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-23 18:17:28,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-23 18:17:28,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-23 18:17:28,868 INFO L234 CfgBuilder]: Building ICFG [2022-02-23 18:17:28,870 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-23 18:17:28,996 INFO L275 CfgBuilder]: Performing block encoding [2022-02-23 18:17:29,001 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-23 18:17:29,001 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-23 18:17:29,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 06:17:29 BoogieIcfgContainer [2022-02-23 18:17:29,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-23 18:17:29,003 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-23 18:17:29,003 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-23 18:17:29,004 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-23 18:17:29,007 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 06:17:29" (1/1) ... [2022-02-23 18:17:29,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.02 06:17:29 BasicIcfg [2022-02-23 18:17:29,022 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-23 18:17:29,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-23 18:17:29,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-23 18:17:29,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-23 18:17:29,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.02 06:17:28" (1/4) ... [2022-02-23 18:17:29,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619769e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 06:17:29, skipping insertion in model container [2022-02-23 18:17:29,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:17:28" (2/4) ... [2022-02-23 18:17:29,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619769e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 06:17:29, skipping insertion in model container [2022-02-23 18:17:29,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 06:17:29" (3/4) ... [2022-02-23 18:17:29,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619769e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.02 06:17:29, skipping insertion in model container [2022-02-23 18:17:29,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.02 06:17:29" (4/4) ... [2022-02-23 18:17:29,028 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound50.cJordan [2022-02-23 18:17:29,032 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-23 18:17:29,032 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-23 18:17:29,065 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-23 18:17:29,070 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:29,070 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-23 18:17:29,092 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:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-23 18:17:29,098 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:29,098 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:29,099 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:29,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:29,102 INFO L85 PathProgramCache]: Analyzing trace with hash 734203501, now seen corresponding path program 1 times [2022-02-23 18:17:29,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:29,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007457009] [2022-02-23 18:17:29,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:29,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:29,202 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:29,203 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1148349314] [2022-02-23 18:17:29,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:29,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:29,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:29,228 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:29,285 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:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 18:17:29,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-23 18:17:29,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:29,382 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:29,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 18:17:29,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:29,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007457009] [2022-02-23 18:17:29,384 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:29,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148349314] [2022-02-23 18:17:29,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148349314] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 18:17:29,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 18:17:29,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-23 18:17:29,386 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089886738] [2022-02-23 18:17:29,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 18:17:29,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-23 18:17:29,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:29,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-23 18:17:29,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-23 18:17:29,415 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:29,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:29,424 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-23 18:17:29,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-23 18:17:29,425 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:29,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:29,434 INFO L225 Difference]: With dead ends: 30 [2022-02-23 18:17:29,434 INFO L226 Difference]: Without dead ends: 25 [2022-02-23 18:17:29,435 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:29,437 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:29,437 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:29,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-23 18:17:29,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-23 18:17:29,460 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:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-02-23 18:17:29,461 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-02-23 18:17:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:29,462 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-02-23 18:17:29,462 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:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-23 18:17:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-23 18:17:29,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:29,463 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:29,485 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:29,668 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:29,669 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:29,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:29,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1669026344, now seen corresponding path program 1 times [2022-02-23 18:17:29,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:29,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505220130] [2022-02-23 18:17:29,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:29,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:29,693 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:29,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [995458834] [2022-02-23 18:17:29,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:29,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:29,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:29,697 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:29,699 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:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 18:17:29,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-23 18:17:29,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:29,861 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:29,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 18:17:29,862 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:29,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505220130] [2022-02-23 18:17:29,862 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:29,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995458834] [2022-02-23 18:17:29,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995458834] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 18:17:29,862 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 18:17:29,862 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-23 18:17:29,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943147595] [2022-02-23 18:17:29,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 18:17:29,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-23 18:17:29,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:29,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-23 18:17:29,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-23 18:17:29,868 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:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:29,889 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-23 18:17:29,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-23 18:17:29,890 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:29,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:29,892 INFO L225 Difference]: With dead ends: 27 [2022-02-23 18:17:29,892 INFO L226 Difference]: Without dead ends: 27 [2022-02-23 18:17:29,892 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:29,893 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:29,894 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:29,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-23 18:17:29,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-23 18:17:29,897 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:29,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-02-23 18:17:29,897 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-02-23 18:17:29,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:29,898 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-02-23 18:17:29,898 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:29,898 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-23 18:17:29,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-23 18:17:29,899 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:29,899 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:29,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-23 18:17:30,100 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:30,101 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:30,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:30,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1667953868, now seen corresponding path program 1 times [2022-02-23 18:17:30,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:30,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325342520] [2022-02-23 18:17:30,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:30,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:30,110 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:30,110 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [853498410] [2022-02-23 18:17:30,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:30,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:30,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:30,120 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:30,122 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:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 18:17:30,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-23 18:17:30,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:30,418 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:30,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 18:17:30,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:30,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325342520] [2022-02-23 18:17:30,418 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:30,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853498410] [2022-02-23 18:17:30,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853498410] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 18:17:30,419 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 18:17:30,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-23 18:17:30,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067221506] [2022-02-23 18:17:30,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 18:17:30,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-23 18:17:30,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:30,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-23 18:17:30,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-23 18:17:30,420 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:32,449 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:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:32,474 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-23 18:17:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-23 18:17:32,475 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:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:32,476 INFO L225 Difference]: With dead ends: 35 [2022-02-23 18:17:32,476 INFO L226 Difference]: Without dead ends: 35 [2022-02-23 18:17:32,476 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:32,477 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:32,477 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:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-23 18:17:32,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-02-23 18:17:32,481 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:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-02-23 18:17:32,481 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-02-23 18:17:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:32,482 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-02-23 18:17:32,482 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:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-23 18:17:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-23 18:17:32,482 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:32,482 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:32,501 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:32,686 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:32,687 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:32,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:32,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1179905874, now seen corresponding path program 1 times [2022-02-23 18:17:32,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:32,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84544284] [2022-02-23 18:17:32,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:32,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:32,695 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:32,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1362172059] [2022-02-23 18:17:32,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:32,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:32,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:32,704 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:32,736 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:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 18:17:32,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-23 18:17:32,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:32,883 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:32,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 18:17:33,032 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:33,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:33,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84544284] [2022-02-23 18:17:33,032 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:33,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362172059] [2022-02-23 18:17:33,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362172059] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 18:17:33,033 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 18:17:33,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-02-23 18:17:33,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966024846] [2022-02-23 18:17:33,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 18:17:33,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-23 18:17:33,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:33,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-23 18:17:33,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-23 18:17:33,034 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:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:33,186 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-02-23 18:17:33,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-23 18:17:33,187 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:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:33,188 INFO L225 Difference]: With dead ends: 37 [2022-02-23 18:17:33,188 INFO L226 Difference]: Without dead ends: 34 [2022-02-23 18:17:33,189 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:33,189 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:33,190 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:33,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-23 18:17:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-02-23 18:17:33,195 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:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-02-23 18:17:33,196 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-02-23 18:17:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:33,196 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-02-23 18:17:33,196 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:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-23 18:17:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-23 18:17:33,197 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:33,197 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:33,231 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:33,416 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:33,416 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:33,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:33,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1668946595, now seen corresponding path program 1 times [2022-02-23 18:17:33,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:33,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998292222] [2022-02-23 18:17:33,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:33,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:33,423 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:33,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1721960048] [2022-02-23 18:17:33,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:33,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:33,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:33,428 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:33,432 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:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 18:17:33,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-23 18:17:33,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:33,540 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:33,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 18:17:33,590 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:33,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:33,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998292222] [2022-02-23 18:17:33,590 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:33,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721960048] [2022-02-23 18:17:33,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721960048] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 18:17:33,590 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 18:17:33,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-23 18:17:33,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912369181] [2022-02-23 18:17:33,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 18:17:33,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-23 18:17:33,591 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:33,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-23 18:17:33,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-23 18:17:33,591 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:33,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:33,635 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-02-23 18:17:33,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-23 18:17:33,635 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:33,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:33,637 INFO L225 Difference]: With dead ends: 56 [2022-02-23 18:17:33,638 INFO L226 Difference]: Without dead ends: 56 [2022-02-23 18:17:33,638 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:33,642 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:33,642 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:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-23 18:17:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-23 18:17:33,647 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:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-02-23 18:17:33,655 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-02-23 18:17:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:33,655 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-02-23 18:17:33,655 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:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-02-23 18:17:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-23 18:17:33,656 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:33,656 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:33,673 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:33,857 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:33,857 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:33,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:33,857 INFO L85 PathProgramCache]: Analyzing trace with hash -906969448, now seen corresponding path program 2 times [2022-02-23 18:17:33,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:33,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54408712] [2022-02-23 18:17:33,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:33,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:33,868 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:33,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386447788] [2022-02-23 18:17:33,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 18:17:33,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:33,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:33,877 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:33,893 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:33,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 18:17:33,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 18:17:33,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-23 18:17:33,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:34,047 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:34,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 18:17:34,193 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:34,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:34,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54408712] [2022-02-23 18:17:34,194 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:34,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386447788] [2022-02-23 18:17:34,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386447788] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 18:17:34,194 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 18:17:34,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-02-23 18:17:34,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268083037] [2022-02-23 18:17:34,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 18:17:34,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-23 18:17:34,195 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:34,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-23 18:17:34,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-23 18:17:34,196 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:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:34,337 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-02-23 18:17:34,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-23 18:17:34,337 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:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:34,338 INFO L225 Difference]: With dead ends: 110 [2022-02-23 18:17:34,338 INFO L226 Difference]: Without dead ends: 110 [2022-02-23 18:17:34,339 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:34,339 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:34,339 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:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-02-23 18:17:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-02-23 18:17:34,345 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:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-02-23 18:17:34,346 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-02-23 18:17:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:34,346 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-02-23 18:17:34,347 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:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-02-23 18:17:34,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-23 18:17:34,349 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:34,349 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:34,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-23 18:17:34,569 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:34,569 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:34,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:34,570 INFO L85 PathProgramCache]: Analyzing trace with hash 191644600, now seen corresponding path program 3 times [2022-02-23 18:17:34,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:34,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152243223] [2022-02-23 18:17:34,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:34,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:34,582 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:34,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2085075626] [2022-02-23 18:17:34,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-23 18:17:34,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:34,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:34,613 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:34,614 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:36,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-23 18:17:36,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 18:17:36,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-23 18:17:36,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:36,956 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:36,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 18:17:37,278 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:37,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:37,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152243223] [2022-02-23 18:17:37,279 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:37,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085075626] [2022-02-23 18:17:37,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085075626] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 18:17:37,279 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 18:17:37,279 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-02-23 18:17:37,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763472567] [2022-02-23 18:17:37,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 18:17:37,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-23 18:17:37,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:37,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-23 18:17:37,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-02-23 18:17:37,281 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-02-23 18:17:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:37,614 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2022-02-23 18:17:37,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-23 18:17:37,615 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 113 [2022-02-23 18:17:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:37,616 INFO L225 Difference]: With dead ends: 218 [2022-02-23 18:17:37,616 INFO L226 Difference]: Without dead ends: 218 [2022-02-23 18:17:37,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-02-23 18:17:37,617 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 335 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 18:17:37,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 238 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 18:17:37,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-02-23 18:17:37,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-02-23 18:17:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-23 18:17:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 241 transitions. [2022-02-23 18:17:37,627 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 241 transitions. Word has length 113 [2022-02-23 18:17:37,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:37,628 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 241 transitions. [2022-02-23 18:17:37,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-02-23 18:17:37,628 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-02-23 18:17:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-02-23 18:17:37,630 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:37,630 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 18:17:37,652 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:37,835 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:37,836 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:37,836 INFO L85 PathProgramCache]: Analyzing trace with hash -698087944, now seen corresponding path program 4 times [2022-02-23 18:17:37,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:37,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832770716] [2022-02-23 18:17:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:37,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:37,847 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:37,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445379242] [2022-02-23 18:17:37,847 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-23 18:17:37,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:37,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:37,848 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:37,852 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:38,063 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-23 18:17:38,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 18:17:38,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-23 18:17:38,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 2123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 18:17:38,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 18:17:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2022-02-23 18:17:39,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:39,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832770716] [2022-02-23 18:17:39,513 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:39,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445379242] [2022-02-23 18:17:39,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445379242] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 18:17:39,513 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 18:17:39,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-02-23 18:17:39,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656915631] [2022-02-23 18:17:39,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 18:17:39,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-02-23 18:17:39,514 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:39,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-02-23 18:17:39,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-02-23 18:17:39,516 INFO L87 Difference]: Start difference. First operand 218 states and 241 transitions. Second operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-02-23 18:17:40,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:40,603 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2022-02-23 18:17:40,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-02-23 18:17:40,603 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 221 [2022-02-23 18:17:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:40,607 INFO L225 Difference]: With dead ends: 434 [2022-02-23 18:17:40,607 INFO L226 Difference]: Without dead ends: 434 [2022-02-23 18:17:40,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-02-23 18:17:40,609 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 631 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-23 18:17:40,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 506 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-23 18:17:40,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-02-23 18:17:40,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-02-23 18:17:40,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-02-23 18:17:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2022-02-23 18:17:40,623 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 221 [2022-02-23 18:17:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:40,624 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2022-02-23 18:17:40,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-02-23 18:17:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-02-23 18:17:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-02-23 18:17:40,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:40,629 INFO L514 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 18:17:40,655 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:40,855 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:40,856 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:40,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:40,856 INFO L85 PathProgramCache]: Analyzing trace with hash -619812232, now seen corresponding path program 5 times [2022-02-23 18:17:40,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:40,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493557820] [2022-02-23 18:17:40,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:40,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:40,870 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:40,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269355915] [2022-02-23 18:17:40,870 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-23 18:17:40,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:40,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:40,879 INFO L229 MonitoredProcess]: Starting monitored process 10 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:40,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-23 18:17:43,119 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-02-23 18:17:43,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 18:17:43,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 97 conjunts are in the unsatisfiable core [2022-02-23 18:17:43,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 18:17:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 9407 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 18:17:44,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 18:17:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2022-02-23 18:17:45,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 18:17:45,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493557820] [2022-02-23 18:17:45,356 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 18:17:45,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269355915] [2022-02-23 18:17:45,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269355915] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 18:17:45,356 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 18:17:45,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 54 [2022-02-23 18:17:45,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144590546] [2022-02-23 18:17:45,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 18:17:45,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-02-23 18:17:45,359 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 18:17:45,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-02-23 18:17:45,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-02-23 18:17:45,361 INFO L87 Difference]: Start difference. First operand 434 states and 481 transitions. Second operand has 54 states, 54 states have (on average 6.62962962962963) internal successors, (358), 54 states have internal predecessors, (358), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) [2022-02-23 18:17:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 18:17:46,562 INFO L93 Difference]: Finished difference Result 470 states and 521 transitions. [2022-02-23 18:17:46,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-02-23 18:17:46,563 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.62962962962963) internal successors, (358), 54 states have internal predecessors, (358), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) Word has length 437 [2022-02-23 18:17:46,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 18:17:46,565 INFO L225 Difference]: With dead ends: 470 [2022-02-23 18:17:46,565 INFO L226 Difference]: Without dead ends: 470 [2022-02-23 18:17:46,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 820 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-02-23 18:17:46,568 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 458 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-23 18:17:46,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 474 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-23 18:17:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-02-23 18:17:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2022-02-23 18:17:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 362 states have (on average 1.1408839779005524) internal successors, (413), 362 states have internal predecessors, (413), 55 states have call successors, (55), 54 states have call predecessors, (55), 52 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-02-23 18:17:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 521 transitions. [2022-02-23 18:17:46,582 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 521 transitions. Word has length 437 [2022-02-23 18:17:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 18:17:46,583 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 521 transitions. [2022-02-23 18:17:46,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.62962962962963) internal successors, (358), 54 states have internal predecessors, (358), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) [2022-02-23 18:17:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 521 transitions. [2022-02-23 18:17:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2022-02-23 18:17:46,592 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 18:17:46,593 INFO L514 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 18:17:46,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-23 18:17:46,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:46,817 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 18:17:46,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 18:17:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1070552264, now seen corresponding path program 6 times [2022-02-23 18:17:46,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 18:17:46,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184987091] [2022-02-23 18:17:46,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 18:17:46,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 18:17:46,846 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 18:17:46,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1980383693] [2022-02-23 18:17:46,846 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-23 18:17:46,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 18:17:46,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 18:17:46,848 INFO L229 MonitoredProcess]: Starting monitored process 11 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:46,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-23 18:26:44,516 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2022-02-23 18:26:44,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-23 18:26:44,517 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-23 18:26:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-23 18:26:44,925 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-23 18:26:44,926 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-23 18:26:44,927 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-23 18:26:44,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-23 18:26:45,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-23 18:26:45,158 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2022-02-23 18:26:45,161 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-23 18:26:45,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.02 06:26:45 BasicIcfg [2022-02-23 18:26:45,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-23 18:26:45,261 INFO L158 Benchmark]: Toolchain (without parser) took 556716.61ms. Allocated memory was 208.7MB in the beginning and 300.9MB in the end (delta: 92.3MB). Free memory was 157.9MB in the beginning and 240.7MB in the end (delta: -82.8MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-02-23 18:26:45,261 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 208.7MB. Free memory was 174.5MB in the beginning and 174.4MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-23 18:26:45,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.67ms. Allocated memory is still 208.7MB. Free memory was 157.7MB in the beginning and 184.6MB in the end (delta: -26.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-23 18:26:45,261 INFO L158 Benchmark]: Boogie Preprocessor took 23.37ms. Allocated memory is still 208.7MB. Free memory was 184.6MB in the beginning and 183.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-23 18:26:45,261 INFO L158 Benchmark]: RCFGBuilder took 260.62ms. Allocated memory is still 208.7MB. Free memory was 183.2MB in the beginning and 172.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-23 18:26:45,261 INFO L158 Benchmark]: IcfgTransformer took 19.45ms. Allocated memory is still 208.7MB. Free memory was 172.7MB in the beginning and 171.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-23 18:26:45,262 INFO L158 Benchmark]: TraceAbstraction took 556236.95ms. Allocated memory was 208.7MB in the beginning and 300.9MB in the end (delta: 92.3MB). Free memory was 171.3MB in the beginning and 240.7MB in the end (delta: -69.4MB). Peak memory consumption was 23.6MB. Max. memory is 8.0GB. [2022-02-23 18:26:45,262 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.09ms. Allocated memory is still 208.7MB. Free memory was 174.5MB in the beginning and 174.4MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 169.67ms. Allocated memory is still 208.7MB. Free memory was 157.7MB in the beginning and 184.6MB in the end (delta: -26.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.37ms. Allocated memory is still 208.7MB. Free memory was 184.6MB in the beginning and 183.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 260.62ms. Allocated memory is still 208.7MB. Free memory was 183.2MB in the beginning and 172.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 19.45ms. Allocated memory is still 208.7MB. Free memory was 172.7MB in the beginning and 171.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 556236.95ms. Allocated memory was 208.7MB in the beginning and 300.9MB in the end (delta: 92.3MB). Free memory was 171.3MB in the beginning and 240.7MB in the end (delta: -69.4MB). Peak memory consumption was 23.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)=52, 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=1567505, counter=0, R=1253] [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=1567505, counter=0, R=1253] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [\old(counter)=0, A=1567505, counter=0, r=2504, R=1253, u=2507, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=1, counter++=0, r=2504, R=1253, u=2507, v=1] [L34] COND TRUE counter++<50 [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=1567505, counter=1, r=2504, R=1253, u=2507, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=1, r=2504, R=1253, u=2507, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=1, R=1253, r=2503, u=2507, v=3] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=2, counter++=1, r=2503, R=1253, u=2507, v=3] [L34] COND TRUE counter++<50 [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=1567505, counter=2, r=2503, R=1253, u=2507, v=3] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=2, R=1253, r=2503, u=2507, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=2, R=1253, r=2500, u=2507, v=5] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=3, counter++=2, r=2500, R=1253, u=2507, v=5] [L34] COND TRUE counter++<50 [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=1567505, counter=3, r=2500, R=1253, u=2507, v=5] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=3, R=1253, r=2500, u=2507, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=3, R=1253, r=2495, u=2507, v=7] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=4, counter++=3, r=2495, R=1253, u=2507, v=7] [L34] COND TRUE counter++<50 [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=1567505, counter=4, R=1253, r=2495, u=2507, v=7] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=4, R=1253, r=2495, u=2507, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=4, R=1253, r=2488, u=2507, v=9] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=5, counter++=4, R=1253, r=2488, u=2507, v=9] [L34] COND TRUE counter++<50 [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=1567505, counter=5, R=1253, r=2488, u=2507, v=9] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=5, r=2488, R=1253, u=2507, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=5, r=2479, R=1253, u=2507, v=11] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=6, counter++=5, R=1253, r=2479, u=2507, v=11] [L34] COND TRUE counter++<50 [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=1567505, counter=6, R=1253, r=2479, u=2507, v=11] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=6, R=1253, r=2479, u=2507, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=6, R=1253, r=2468, u=2507, v=13] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=7, counter++=6, R=1253, r=2468, u=2507, v=13] [L34] COND TRUE counter++<50 [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=1567505, counter=7, R=1253, r=2468, u=2507, v=13] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=7, r=2468, R=1253, u=2507, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=7, R=1253, r=2455, u=2507, v=15] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=8, counter++=7, r=2455, R=1253, u=2507, v=15] [L34] COND TRUE counter++<50 [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=1567505, counter=8, R=1253, r=2455, u=2507, v=15] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=8, R=1253, r=2455, u=2507, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=8, r=2440, R=1253, u=2507, v=17] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=9, counter++=8, R=1253, r=2440, u=2507, v=17] [L34] COND TRUE counter++<50 [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=1567505, counter=9, R=1253, r=2440, u=2507, v=17] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=9, R=1253, r=2440, u=2507, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=9, r=2423, R=1253, u=2507, v=19] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=10, counter++=9, r=2423, R=1253, u=2507, v=19] [L34] COND TRUE counter++<50 [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=1567505, counter=10, R=1253, r=2423, u=2507, v=19] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=10, R=1253, r=2423, u=2507, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=10, r=2404, R=1253, u=2507, v=21] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=11, counter++=10, R=1253, r=2404, u=2507, v=21] [L34] COND TRUE counter++<50 [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=1567505, counter=11, R=1253, r=2404, u=2507, v=21] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=11, r=2404, R=1253, u=2507, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=11, R=1253, r=2383, u=2507, v=23] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=12, counter++=11, R=1253, r=2383, u=2507, v=23] [L34] COND TRUE counter++<50 [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=1567505, counter=12, R=1253, r=2383, u=2507, v=23] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=12, r=2383, R=1253, u=2507, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=12, r=2360, R=1253, u=2507, v=25] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=13, counter++=12, r=2360, R=1253, u=2507, v=25] [L34] COND TRUE counter++<50 [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=1567505, counter=13, r=2360, R=1253, u=2507, v=25] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=13, R=1253, r=2360, u=2507, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=13, r=2335, R=1253, u=2507, v=27] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=14, counter++=13, r=2335, R=1253, u=2507, v=27] [L34] COND TRUE counter++<50 [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=1567505, counter=14, R=1253, r=2335, u=2507, v=27] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=14, R=1253, r=2335, u=2507, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=14, r=2308, R=1253, u=2507, v=29] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=15, counter++=14, R=1253, r=2308, u=2507, v=29] [L34] COND TRUE counter++<50 [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=1567505, counter=15, r=2308, R=1253, u=2507, v=29] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=15, r=2308, R=1253, u=2507, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=15, r=2279, R=1253, u=2507, v=31] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=16, counter++=15, r=2279, R=1253, u=2507, v=31] [L34] COND TRUE counter++<50 [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=1567505, counter=16, r=2279, R=1253, u=2507, v=31] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=16, R=1253, r=2279, u=2507, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=16, R=1253, r=2248, u=2507, v=33] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=17, counter++=16, r=2248, R=1253, u=2507, v=33] [L34] COND TRUE counter++<50 [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=1567505, counter=17, r=2248, R=1253, u=2507, v=33] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=17, R=1253, r=2248, u=2507, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=17, r=2215, R=1253, u=2507, v=35] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=18, counter++=17, r=2215, R=1253, u=2507, v=35] [L34] COND TRUE counter++<50 [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=1567505, counter=18, R=1253, r=2215, u=2507, v=35] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=18, R=1253, r=2215, u=2507, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=18, R=1253, r=2180, u=2507, v=37] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=19, counter++=18, R=1253, r=2180, u=2507, v=37] [L34] COND TRUE counter++<50 [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=1567505, counter=19, R=1253, r=2180, u=2507, v=37] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=19, r=2180, R=1253, u=2507, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=19, R=1253, r=2143, u=2507, v=39] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=20, counter++=19, R=1253, r=2143, u=2507, v=39] [L34] COND TRUE counter++<50 [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=1567505, counter=20, r=2143, R=1253, u=2507, v=39] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=20, r=2143, R=1253, u=2507, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=20, r=2104, R=1253, u=2507, v=41] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=21, counter++=20, r=2104, R=1253, u=2507, v=41] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=21, r=2104, R=1253, u=2507, v=41] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=21, R=1253, r=2104, u=2507, v=41] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=21, r=2063, R=1253, u=2507, v=43] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=22, counter++=21, r=2063, R=1253, u=2507, v=43] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=22, R=1253, r=2063, u=2507, v=43] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=22, r=2063, R=1253, u=2507, v=43] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=22, R=1253, r=2020, u=2507, v=45] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=23, counter++=22, r=2020, R=1253, u=2507, v=45] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=23, r=2020, R=1253, u=2507, v=45] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=23, r=2020, R=1253, u=2507, v=45] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=23, r=1975, R=1253, u=2507, v=47] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=24, counter++=23, r=1975, R=1253, u=2507, v=47] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=24, r=1975, R=1253, u=2507, v=47] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=24, r=1975, R=1253, u=2507, v=47] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=24, r=1928, R=1253, u=2507, v=49] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=25, counter++=24, r=1928, R=1253, u=2507, v=49] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=25, R=1253, r=1928, u=2507, v=49] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=25, r=1928, R=1253, u=2507, v=49] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=25, R=1253, r=1879, u=2507, v=51] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=26, counter++=25, r=1879, R=1253, u=2507, v=51] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=26, r=1879, R=1253, u=2507, v=51] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=26, r=1879, R=1253, u=2507, v=51] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=26, r=1828, R=1253, u=2507, v=53] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=27, counter++=26, R=1253, r=1828, u=2507, v=53] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=27, R=1253, r=1828, u=2507, v=53] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=27, R=1253, r=1828, u=2507, v=53] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=27, r=1775, R=1253, u=2507, v=55] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=28, counter++=27, r=1775, R=1253, u=2507, v=55] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=28, r=1775, R=1253, u=2507, v=55] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=28, R=1253, r=1775, u=2507, v=55] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=28, r=1720, R=1253, u=2507, v=57] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=29, counter++=28, r=1720, R=1253, u=2507, v=57] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=29, R=1253, r=1720, u=2507, v=57] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=29, R=1253, r=1720, u=2507, v=57] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=29, r=1663, R=1253, u=2507, v=59] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=30, counter++=29, r=1663, R=1253, u=2507, v=59] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=30, r=1663, R=1253, u=2507, v=59] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=30, r=1663, R=1253, u=2507, v=59] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=30, R=1253, r=1604, u=2507, v=61] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=31, counter++=30, R=1253, r=1604, u=2507, v=61] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=31, R=1253, r=1604, u=2507, v=61] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=31, r=1604, R=1253, u=2507, v=61] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=31, R=1253, r=1543, u=2507, v=63] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=32, counter++=31, R=1253, r=1543, u=2507, v=63] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=32, r=1543, R=1253, u=2507, v=63] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=32, R=1253, r=1543, u=2507, v=63] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=32, r=1480, R=1253, u=2507, v=65] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=33, counter++=32, r=1480, R=1253, u=2507, v=65] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=33, r=1480, R=1253, u=2507, v=65] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=33, r=1480, R=1253, u=2507, v=65] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=33, R=1253, r=1415, u=2507, v=67] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=34, counter++=33, r=1415, R=1253, u=2507, v=67] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=34, R=1253, r=1415, u=2507, v=67] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=34, r=1415, R=1253, u=2507, v=67] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=34, R=1253, r=1348, u=2507, v=69] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=35, counter++=34, R=1253, r=1348, u=2507, v=69] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=35, R=1253, r=1348, u=2507, v=69] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=35, r=1348, R=1253, u=2507, v=69] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=35, R=1253, r=1279, u=2507, v=71] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=36, counter++=35, R=1253, r=1279, u=2507, v=71] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=36, R=1253, r=1279, u=2507, v=71] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=36, r=1279, R=1253, u=2507, v=71] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=36, r=1208, R=1253, u=2507, v=73] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=37, counter++=36, R=1253, r=1208, u=2507, v=73] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=37, R=1253, r=1208, u=2507, v=73] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=37, r=1208, R=1253, u=2507, v=73] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=37, r=1135, R=1253, u=2507, v=75] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=38, counter++=37, r=1135, R=1253, u=2507, v=75] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=38, R=1253, r=1135, u=2507, v=75] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=38, r=1135, R=1253, u=2507, v=75] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=38, r=1060, R=1253, u=2507, v=77] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=39, counter++=38, r=1060, R=1253, u=2507, v=77] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=39, r=1060, R=1253, u=2507, v=77] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=39, R=1253, r=1060, u=2507, v=77] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=39, r=983, R=1253, u=2507, v=79] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=40, counter++=39, r=983, R=1253, u=2507, v=79] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=40, r=983, R=1253, u=2507, v=79] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=40, r=983, R=1253, u=2507, v=79] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=40, R=1253, r=904, u=2507, v=81] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=41, counter++=40, R=1253, r=904, u=2507, v=81] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=41, R=1253, r=904, u=2507, v=81] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=41, R=1253, r=904, u=2507, v=81] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=41, R=1253, r=823, u=2507, v=83] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=42, counter++=41, R=1253, r=823, u=2507, v=83] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=42, r=823, R=1253, u=2507, v=83] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=42, R=1253, r=823, u=2507, v=83] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=42, r=740, R=1253, u=2507, v=85] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=43, counter++=42, R=1253, r=740, u=2507, v=85] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=43, r=740, R=1253, u=2507, v=85] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=43, r=740, R=1253, u=2507, v=85] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=43, R=1253, r=655, u=2507, v=87] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=44, counter++=43, r=655, R=1253, u=2507, v=87] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=44, R=1253, r=655, u=2507, v=87] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=44, R=1253, r=655, u=2507, v=87] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=44, r=568, R=1253, u=2507, v=89] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=45, counter++=44, r=568, R=1253, u=2507, v=89] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=45, r=568, R=1253, u=2507, v=89] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=45, R=1253, r=568, u=2507, v=89] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=45, r=479, R=1253, u=2507, v=91] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=46, counter++=45, R=1253, r=479, u=2507, v=91] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=46, r=479, R=1253, u=2507, v=91] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=46, r=479, R=1253, u=2507, v=91] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=46, R=1253, r=388, u=2507, v=93] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=47, counter++=46, r=388, R=1253, u=2507, v=93] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=47, R=1253, r=388, u=2507, v=93] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=47, r=388, R=1253, u=2507, v=93] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=47, r=295, R=1253, u=2507, v=95] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=48, counter++=47, R=1253, r=295, u=2507, v=95] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=48, R=1253, r=295, u=2507, v=95] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=48, R=1253, r=295, u=2507, v=95] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=48, r=200, R=1253, u=2507, v=97] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=49, counter++=48, r=200, R=1253, u=2507, v=97] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=49, R=1253, r=200, u=2507, v=97] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=49, r=200, R=1253, u=2507, v=97] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=49, R=1253, r=103, u=2507, v=99] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=50, counter++=49, R=1253, r=103, u=2507, v=99] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=50, r=103, R=1253, u=2507, v=99] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=50, r=103, R=1253, u=2507, v=99] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=50, R=1253, r=4, u=2507, v=101] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=51, counter++=50, r=4, R=1253, u=2507, v=101] [L34] COND FALSE !(counter++<50) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, \old(counter)=0, counter=51] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] [L14] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 556.1s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1596 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1595 mSDsluCounter, 1755 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1393 mSDsCounter, 528 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 858 IncrementalHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 528 mSolverCounterUnsat, 362 mSDtfsCounter, 858 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1972 GetRequests, 1684 SyntacticMatches, 2 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2921 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=470occurred in iteration=9, InterpolantAutomatonStates: 293, 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, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 542.2s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1432 NumberOfCodeBlocks, 1432 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 1835 ConstructedInterpolants, 0 QuantifiedInterpolants, 4655 SizeOfPredicates, 98 NumberOfNonLiveVariables, 2504 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 5662/24434 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:26:45,275 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...